SCOPUS 정보 검색 플랫폼

International Journal of Quantum Information

Volumn 3, Issue 3, 2005, Pages 463-473

"Non-identity-check" is QMA-complete

(3) Janzing, Dominik a Wocjan, Pawel a Beth, Thomas a

a UNIVERSITY OF KARLSRUHE (Germany)

Author keywords

Quantum complexity theory

Indexed keywords

QUANTUM COMPUTERS;

COMPLEXITY CLASS; COMPUTATIONAL PROBLEM; DECISION PROBLEMS; ELEMENTARY GATES; IDENTITY MATRICES; INVARIANT SUBSPACE; QUANTUM COMPLEXITY; QUANTUM COMPUTING;

COMPUTATIONAL COMPLEXITY;

EID: 33746317037 PISSN: 02197499 EISSN: None Source Type: Journal
DOI: 10.1142/S0219749905001067 Document Type: Article

Times cited : (84)

References (14)

1
- 0005425501
- (Freeman and Company, New York)
- M. Garey and D. Johnson, Computers and Intractibility (Freeman and Company, New York, 1979).
- (1979) Computers and Intractibility
- Garey, M.¹ Johnson, D.²

2
- 0004342981
- (American Mathematical Society, Providence, Rhode Island)
- A. Kitaev, A. Shen and M. Vyalyi, Classical and Quantum Computation, Vol. 47 (American Mathematical Society, Providence, Rhode Island, 2002).
- (2002) Classical and Quantum Computation , vol.47
- Kitaev, A.¹ Shen, A.² Vyalyi, M.³

3
- 0141547670
- quant-ph/0210077
- D. Aharonov and T. Naveh, Quantum NP - A survey, quant-ph/0210077.
- Quantum NP - A Survey
- Aharonov, D.¹ Naveh, T.²

4
- 0142051871
- Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
- P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26(5), 1484-1509 (1997).
- (1997) SIAM J. Comput. , vol.26 , Issue.5 , pp. 1484-1509
- Shor, P.¹

5
- 0141640891
- 3-local Hamiltonian is QMA-complete
- J. Kempe and O. Regev, 3-local Hamiltonian is QMA-complete, Quant. Inf. Comput. 3, 258-264 (2003).
- (2003) Quant. Inf. Comput. , vol.3 , pp. 258-264
- Kempe, J.¹ Regev, O.²

6
- 34147163913
- The complexity of the local Hamiltonian problem
- in
- J. Kempe, A. Kitaev and O. Regev, The complexity of the local Hamiltonian problem, in Proc. 24th FSTTCS (2004), pp. 372-383.
- (2004) Proc. 24th FSTTCS , pp. 372-383
- Kempe, J.¹ Kitaev, A.² Regev, O.³

7
- 0141438246
- S. Aaronson, The complexity zoo, http://www.cs.berkeley.edu/~aaronson/ zoo.html.
- The Complexity Zoo
- Aaronson, S.¹

8
- 84861593360
- (Cambridge University Press)
- M. Nielsen and I. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2000).
- (2000) Quantum Computation and Quantum Information
- Nielsen, M.¹ Chuang, I.²

9
- 4043092517
- Error correcting codes in quantum theory
- A. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett. 77, 793-797 (1996).
- (1996) Phys. Rev. Lett. , vol.77 , pp. 793-797
- Steane, A.¹

10
- 3543117431
- Noiseless quantum codes
- P. Zanardi and M. Rasetti, Noiseless quantum codes, Phys. Rev. Lett. 79, 3306-3309 (1997).
- (1997) Phys. Rev. Lett. , vol.79 , pp. 3306-3309
- Zanardi, P.¹ Rasetti, M.²

11
- 0042221930
- Implementation of universal control on a decoherence-free qubit
- E. Fortunato, L. Viola, J. Hodges, G. Teklemariam and D. Cory, Implementation of universal control on a decoherence-free qubit, New J. Phys. 4, 5.1-5.20 (2002).
- (2002) New J. Phys. , vol.4
- Fortunato, E.¹ Viola, L.² Hodges, J.³ Teklemariam, G.⁴ Cory, D.⁵

12
- 0003897694
- (Addison Wesley, Reading, MA)
- Ch. Papamitrou, Computational Complexity (Addison Wesley, Reading, MA, 1994).
- (1994) Computational Complexity
- Papamitrou, Ch.¹

13
- 33746708722
- Quantum algorithms revisited
- R. Cleve, A. Ekert, C. Macchiavello and M. Mosca, Quantum algorithms revisited, Proc. Roy. Soc. London A454, 339-354 (1998).
- (1998) Proc. Roy. Soc. London , vol.A454 , pp. 339-354
- Cleve, R.¹ Ekert, A.² Macchiavello, C.³ Mosca, M.⁴

14
- 0003976091
- quant-ph/9804060
- R. Schulman and U. Vazirani, Scalable NMR quantum computers, quant-ph/ 9804060.
- Scalable NMR Quantum Computers
- Schulman, R.¹ Vazirani, U.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.