A promisebqp-complete string rewriting problem

Quantum Information and Computation

Volumn 10, Issue 3-4, 2010, Pages 0234-0257

  Janzing, Dominik ^a   Wocjan, Pawel ^b  

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

^b University of Central Florida   (United States)

Author keywords

Promisebqp; Promisebqp complete problems

Indexed keywords

QUANTUM COMPUTERS;

COMBINATORIAL PROBLEM; COMPLETE PROBLEMS; FINITE ALPHABET; GAP CONDITIONS; GROWTH CONDITIONS; POLYLOGARITHMIC; PROMISEBQP; STRING REWRITING;

INVERSE PROBLEMS;

EID: 77953880274     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (33)

1. O. Goldreich. On promise problems. Electronic Colloquium on Computational Complexity, (18), 2005. http://eccc.hpi-web.de/eccc-reports/2005/TR05-018/index.html
2. D. Janzing and P. Wocjan. A simple PromiseBQP-complete matrix problem. Theory of Computing, 3:61-79, 2007.
3. D. Deutsch. Quantum theory, the Church-Turing Principle and the universal quantum computer. Proceedings of the Royal Society, Series A (400):97-117, 1985.
4. R. Feynman. Simulating physics with computers. Int. Journ. Th. Phys., 21(6/7):467-488, 1982.
5. S. Lloyd. Universal quantum simulators. Science, 273:1073, 1996.
6. C. Zalka. Simulating quantum systems on a quantum computer. Proc. R. Soc. Lond. A, 454(1969):313-322, 1988.
7. D. Janzing, P. Wocjan, and S. Zhang. A single-shot measurement of the energy of product states in a translation invariant spin chain can replace any quantum computation. New Journal of Physics, 10(093004):1-18, 2008.
8. Knill and R. Laflamme. Quantum computation and quadratically signed weight enumerators. Inf. Process. Lett., 79(4), 2001.
9. P. Wocjan and J. Yard. The Jones polynomial: quantum algorithms and applications in quantum complexity theory. Quantum Information & Computation, Vol. 8, No. 3 & 4, pp. 147-180, 2008.
10. D. Aharonov and I. Arad. The BQP-hardness of approximating the Jones polynomial. quant-ph/0605181, 2006.
11. M. Freedman, A. Kitaev, and Z. Wang. Simulation of topological field theories by quantum computers. Comm. Math. Phys., 227(3):587-603, 2002.
12. D. Aharonov, V. Jones, and Z. Landau. A polynomial quantum algorithm for approximating the Jones polynomial. Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle 2006. pp 427-436.
13. Aharonov, I. Arad, E. Eban, and Z. Landau. Polynomial quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane. quant-ph/0702008.
14. L. Fortnow and J. Rogers. Complexity limitations on quantum computation. Proc. of IEEE Complexity' 98, pp. 202-209, 1999.
15. Janzing, P. Wocjan. BQP-complete Problems Concerning Mixing Properties of Classical Random Walks on Sparse Graphs. quantph/0610235.
16. D. Aharonov and A. Ta-Shma. Adiabatic quantum state generation and statistical zero knowledge. In Proc. 35th Annual ACM Symp. on Theory of Computing, pages 20-29, 2003.
17. A. Childs. Quantum information processing in continuous time. PhD thesis, Massachusetts Insti-tute of Technology, 2004.
18. D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders. Efficient quantum algorithms for simulating sparse Hamiltonians. Comm. Math. Phys., 270(2):359-371, 2007.
19. K. Vollbrecht and I. Cirac. Quantum simulators, continuous-time automata, and translationally invariant systems. Phys. Rev Lett., 100:010501, 2008.
20. P. Benioff. The computer as a physical system: A microscopic quantum mechanical model of computers as represented by Turing machines. J. Stat. Phys., 22(5):562-591, 1980.
21. R. Feynman. Quantum mechanical computers. Opt. News, 11:11-46, 1985.
22. N. Margolus. Parallel quantum computation. In W. Zurek, editor, Complexity, Entropy, and the Physics of Information. Addison Wesley Longman, 1990.
23. D. Janzing and P. Wocjan. Ergodic quantum computing. Quant. Inf. Process., 4(2):129-158, 2005.
24. D. Janzing. Spin-1/2 particles moving on a 2D lattice with nearest-neighbor interactions can realize an autonomous quantum computer. Phys. Rev. A 75:012307, 2007.
25. A. Kitaev, A. Shen, and M. Vyalyi. Classical and Quantum Computation, volume 47. Am. Math. Soc., Providence, Rhode Island, 2002.
26. J. Kempe, A. Kitaev, and O. Regev. The complexity of the local Hamiltonian problem. SIAM J. Computing, 35(5):1010-1097, 2006.
27. R. Oliveira and B. Terhal. The complexity of quantum spin systems on a two-dimensional square lattice. Quant. Inf. Comp., 8(10):900-924, 2008.
28. D. Gottesman, D. Aharonov, S. Irani, and J. Kempe. The power of quantum systems on a line. Comm. Math. Phys., 287(1):41-65, 2009.
29. R. Feynman. Feynman Lectures on Computation. Perseus Press, 1996.
30. D. Aharonov. A simple proof that Toffoli and Hadamard are quantum universal. quantph/0301040, 2003.
31. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
32. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journ. Am. Stat. Ass., 58(301):13-30, 1963.
33. D. Cvetkovic. Eigenspaces of graphs. Cambridge University Press, 1997.