{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:10:10Z","timestamp":1746295810381,"version":"3.40.4"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084930"},{"type":"electronic","value":"9783319084947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08494-7_17","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:50:00Z","timestamp":1404571800000},"page":"216-229","source":"Crossref","is-referenced-by-count":5,"title":["BDD Operations for Quantum Graph States"],"prefix":"10.1007","author":[{"given":"Hidefumi","family":"Hiraishi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Aharonov, D., Arad, I., Eban, E., Landau, Z.: Polynomial Quantum Algorithms for Additive approximations of the Potts model and other Points of the Tutte Plane, arXiv:quant-ph\/0702008 (2007)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the Tutte Polynomial in Vertex-Exponential Time. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 677\u2013686 (2008)","DOI":"10.1109\/FOCS.2008.40"},{"issue":"8","key":"17_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"De Las Cuevas, G., D\u00fcr, W., Van den Nest, M., Briegel, H.J.: Completeness of Classical Spin Models and Universal Quantum Computation. Journal of Statistical Mechanics: Theory and Experiment\u00a0P07001 (2009)","DOI":"10.1088\/1742-5468\/2009\/07\/P07001"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-14165-2_37","volume-title":"Automata, Languages and Programming","author":"H. Dell","year":"2010","unstructured":"Dell, H., Husfeldt, T., Wahl\u00e9n, M.: Exponential Time Complexity of the Permanent and the Tutte Polynomial. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 426\u2013437. Springer, Heidelberg (2010)"},{"issue":"5","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1137\/080742270","volume":"39","author":"F.V. Fomin","year":"2010","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Intractability of Clique-Width Parameterizations. SIAM Journal on Computing\u00a039(5), 1941\u20131956 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Fomin, F., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science, An EATCS Series. Springer (2010)","DOI":"10.1007\/978-3-642-16533-7"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1008647823331","volume":"10","author":"M. Fujita","year":"1997","unstructured":"Fujita, M., McGeer, P.C., Yang, J.C.-Y.: Multi-Terminal Binary Decisoin Diagrams: An Efficient Data structure for Matrix Representation. Formal Methods in System Design\u00a010, 149\u2013169 (1997)","journal-title":"Formal Methods in System Design"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Grassl, M., Klappennecker, A., Rotteler, M.: Graphs, Quadratic Forms, and Quantum Codes. In: Proceedings of the 2002 IEEE International Symposium on Information Theory, p. 45 (2002) (see also arXiv:quant-ph\/0703112)","DOI":"10.1109\/ISIT.2002.1023317"},{"key":"17_CR10","unstructured":"Hein, M., D\u00fcr, W., Eisert, J., Raussendorf, R., Van den Nest, M., Briegel, H.-J.: Entanglement in Graph States and Its Applications. In: Quantum Computers, Algorithms and Chaos. Proceedings of the International School of Physics \u201cEnrico Fermi\u201d, vol.\u00a0162, pp. 115\u2013218 (2006)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Hiraishi, H., Imai, H., Iwata, Y., Lin, B.: Representing Quantum Graph States by Binary Decision Diagrams (submitted 2014)","DOI":"10.1007\/978-3-319-08494-7_17"},{"key":"17_CR12","unstructured":"Knuth, D.E.: The Art of Computer Programming. Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams, vol.\u00a04. Addison-Wesley Professional (2009)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Meinel, C., Theobald, T.: Algorithms and Data Structures in VLSI-Design: OBDD\u2014Foundations and Applications. Springer (1998)","DOI":"10.1007\/978-3-642-58940-9"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Minato, S.: Binary Decision Diagrams and Applications for VLSI CAD. Kluwer Academic Publishers (November 1996)","DOI":"10.1007\/978-1-4613-1303-8"},{"key":"17_CR15","unstructured":"Nielsen, M.A., Chuang, I.C.: Quantum Computation and Quantum Information. Cambridge University Press (2000)"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S. Oum","year":"2005","unstructured":"Oum, S.: Rank-Width and Vertex-Minors. Journal of Combinatorial Theory, Series B\u00a095(1), 79\u2013100 (2005)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Oum, S.: Approximating Rank-Width and Clique-Width Quickly. ACM Transactions on Algorithms\u00a05(1), Article 10, 20 (2008)","DOI":"10.1145\/1435375.1435385"},{"key":"17_CR18","unstructured":"Oum, S.: Dynamic Survey on Rank-Width and Related Width Parameters of Graphs, http:\/\/mathsci.kaist.ac.kr\/~sangil\/2013\/dynamic-survey-on-rank-width\/"},{"issue":"4","key":"17_CR19","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.: Approximating Clique-Width and Branch-Width. Journal of Combinatorial Theory, Series B\u00a096(4), 514\u2013528 (2006)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0095-8956(90)90120-O","volume":"48","author":"N. Robertson","year":"1990","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. IV. Tree-Width and Well-Quasi-Ordering. Journal of Combinatorial Theory, Series B\u00a048, 227\u2013254 (1990)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/978-3-540-87744-8_60","volume-title":"Algorithms - ESA 2008","author":"V. Samoladas","year":"2008","unstructured":"Samoladas, V.: Improved BDD Algorithms for the Simulation of Quantum Circuits. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 720\u2013731. Springer, Heidelberg (2008)"},{"issue":"4","key":"17_CR22","doi-asserted-by":"crossref","first-page":"307","DOI":"10.26421\/QIC2.4-4","volume":"2","author":"D. Schlingemann","year":"2002","unstructured":"Schlingemann, D.: Stabilizer Codes can be Realized as Graph Codes. Quantum Information & Computation\u00a02(4), 307\u2013323 (2002)","journal-title":"Quantum Information & Computation"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BFb0015427","volume-title":"Algorithms and Computations","author":"K. Sekine","year":"1995","unstructured":"Sekine, K., Imai, H., Tani, S.: Computing the Tutte Polynomial of a Graph of Moderate Size. In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol.\u00a01004, pp. 224\u2013233. Springer, Heidelberg (1995)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Sinclair, A., Srivastava, P., Yin, Y.: Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant. In: Proceedings of the IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 300\u2013309 (2013)","DOI":"10.1109\/FOCS.2013.40"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Van den Nest, M., Dehaene, J., De Moor, B.: The Invariants of the Local Clifford Group. Physical Review A\u00a071, 022310 (2005)","DOI":"10.1103\/PhysRevA.71.022310"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Van den Nest, M., D\u00fcr, W., Vidal, G., Briegel, H.J.: Classical Simulation versus Universality in Measurement-Based Quantum Computation. Physical Review A\u00a075, 012337, 15 (2007)","DOI":"10.1103\/PhysRevA.75.012337"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Van den Nest, M., D\u00fcr, W., Briegel, H.J.: Completeness of the Classical 2D Ising Model and Universal Quantum Computation. Physical Review Letters\u00a0100, 110501, 4 (2008)","DOI":"10.1103\/PhysRevLett.100.110501"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Van den Nest, M., Miyake, A., D\u00fcr, W., Briegel, H.J.: Universal Resources for Measurement-Based Quantum Computation. Physical Review Letters\u00a097, 150504, 4 (2006)","DOI":"10.1103\/PhysRevLett.97.150504"},{"key":"17_CR29","series-title":"Doctoral Dissertation","volume-title":"Efficient Quantum Circuit Simulation","author":"G.F. Viamontes","year":"2007","unstructured":"Viamontes, G.F.: Efficient Quantum Circuit Simulation. Doctoral Dissertation. Department of Computer Science and Engineering, The University of Michigan (2007)"},{"issue":"5","key":"17_CR30","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1023\/B:QINP.0000022725.70000.4a","volume":"2","author":"G.F. Viamontes","year":"2003","unstructured":"Viamontes, G.F., Markov, I.L., Hayes, J.P.: Improving Gate-Level Simulation of Quantum Circuits. Quantum Information Processing\u00a02(5), 347\u2013380 (2003)","journal-title":"Quantum Information Processing"},{"issue":"2","key":"17_CR31","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1093\/ietfec\/e91-a.2.584","volume":"E91-A","author":"S.A. Wang","year":"2008","unstructured":"Wang, S.A., Lu, C.Y., Tsai, I.M., Kuo, S.Y.: An XQDD-Based Verification Method for Quantum Circuits. IEICE Trans. Fundamentals\u00a0E91-A(2), 584\u2013594 (2008)","journal-title":"IEICE Trans. Fundamentals"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Welsh, D.J.A.: Complexity: Knots, Colourings and Counting. London Mathematical Society Lecture Note Series, vol. 186. Cambridge University Press (1993)","DOI":"10.1017\/CBO9780511752506"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08494-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:49:24Z","timestamp":1746294564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08494-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084930","9783319084947"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08494-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}