A new connection between quantum circuits, graphs and the Ising partition function

Quantum Information Processing

Volumn 7, Issue 5, 2008, Pages 227-242

  Geraci, Joseph ^a,b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

BQP complete; Ising partition function; Quantum algorithms

Indexed keywords

BQP-COMPLETE; EULERIAN; GENERATING FUNCTIONS; ISING PARTITION FUNCTION; PARTITION FUNCTIONS; QUANTUM ALGORITHMS; QUANTUM CIRCUITS; SUBGRAPHS; WEIGHT ENUMERATORS;

FUNCTION EVALUATION; GRAPH THEORY; LOGIC CIRCUITS; OPTICAL RADAR; QUANTUM THEORY; SEMICONDUCTOR MATERIALS;

PROBABILITY DENSITY FUNCTION;

EID: 55849113318     PISSN: 15700755     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11128-008-0084-7     Document Type: Article

References (27)

1. L.M. Adleman J. Demarrais M.A. Huang 1997 Quantum computability SIAM J. Comput. 26 5 1524 1540
2. Aharonov, D., Arad, I.: The BQP-hardness of approximating the Jones Polynomial. quant-ph/0605181
3. 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. quant-ph/0702008
4. Arad, I., Landau, Z.: Quantum computation and the evaluation of tensor networks. Preprint arXiv:0805.0040v2 [quant-ph] (2008)
5. C.H. Bennett E. Bernstein G. Brassard U. Vazirani 1997 Strengths and weaknesses of quantum computing SIAM J. Comput. 26 5 1510 1523
6. Berge, C.: Graphs and Hypergraphs. North-Holland Publishing Co. (1973)
7. E. Bernstein U. Vazirani 1997 Quantum complexity theory SIAM J. Comput. 26 1411 1473
8. M. Bordewich M. Freedman L. Lovasz D. Welsh 2005 Approximate counting and quantum computation Combin. Prob. Comput. 14 737 754
9. Bremmer, M.J., Dawson, C.M., Dodd, J.L., Gilchrist, A., Harrow, A.W., Mortimer, D., Nielson, M.A., Osborne, T.J.: A practical scheme for quantum computation with any two-qubit entangling gate. Preprint quant-ph/0207072v1 (2002)
10. Cheung, D., Maslov, D., Severini, S.: Translation techniques between quantum circuit architectures. Available online at http://www.iqc.ca/~sseverin/ qipabs.pdf
11. 2 Quantum Inform. Comput. 5 102 112
12. Galluccio, A., Loebl, M.: On the theory of Pfaffian Orientations II. T-joins, K-cuts, and duality of enumeration. Electron. J. Combin. 6(1), Research Paper 7 (1999)
13. A. Galluccio M. Loebl J. Vondrak 2000 New algorithm for the Ising problem: partition function for finite lattice graphs Phys. Rev. Lett. 84 5924 5927
14. Geraci, J., Lidar, D.A.: Classical Ising model test for quantum circuits. Paper in preparation
15. Harrow, A.W.: Exact universality from any entangling gate without inverses. Preprint arXiv:0806.0631v1 [quant-ph] (2008)
16. Hein, M., Eisert, J., Briegel, H.J.: Multi-party entanglement in graph states. Eprint quant-ph/0307130 (2005)
17. Knill, E., Laflamme, R.: On the power of one bit of quantum information. arXiv preprint: quant-ph/9802037 (1998)
18. E. Knill R. Laflamme 2001 Quantum computing and quadratically signed weight enumerators Inf. Proc. Lett. 79 173
19. D.A. Lidar 2004 On the quantum computational complexity of the Ising spin glass partition function and of knot invariants New J. Phys. 6 167
20. S. Lloyd 1995 Almost any quantum logic gate is universal Phys. Rev. Lett. 75 346 349
21. Markov, I.L., Shi, Y.: Simulating quantum computation by contracting tensor networks. Preprint quant-ph/0511069 (2007)
22. Nielsen, M.A., Chuang, I.: Quantum Computation and Information. Cambridge University Press (2000)
23. Papadimitriou, C.H.: Computational Complexity. Addison Wesley Longman (1995)
24. Shor, P.W., Jordan, S.P.: Estimating Jones polynomials is a complete problem for one clean qubit. arXiv preprint: quant-ph/0707.2831 (2007)
25. Van den Nest, M., Dür, W., Raussendorf, R., Briegel, H.J.: Quantum algorithms for spin models and simulable gate sets for quantum computation. Preprint arXiv:0805.1214v1 [quant-ph] (2008)
26. Welsh, D.J.A.: Complexity: Knots, Colourings and Counting. London Mathematical Society Lecture Note Series 186. Cambridge University Press (1993)
27. Wocjan, P., Zhang, S.: Several natural BQP-complete problems. Preprint arXiv:quant-ph/0606179 (2006)ss