SCOPUS 정보 검색 플랫폼

SIAM Journal on Computing

Volumn 31, Issue 4, 2002, Pages 1229-1254

Quantum circuits that can be simulated classically in polynomial time

(1) Valiant, Leslie G a

a HARVARD UNIVERSITY (United States)

Author keywords

Matchgates; Polynomial time simulation; Quantum computation; Turing hypothesis

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; LOGIC GATES; MATHEMATICAL MODELS; MATRIX ALGEBRA; NETWORKS (CIRCUITS); QUANTUM THEORY; RANDOM PROCESSES; TURING MACHINES;

GRAPH MATCHING; MATCHGATES; POLYNOMIAL TIME SIMULATION; QUANTUM CIRCUITS; QUANTUM COMPUTATION; TURING HYPOTHESIS;

POLYNOMIALS;

EID: 0036519749 PISSN: 00975397 EISSN: None Source Type: Journal
DOI: 10.1137/S0097539700377025 Document Type: Article

Times cited : (287)

References (38)

1
- 0000357516
- A universal two-bit gate for quantum computation
- (1995) Proc. Roy. Soc. London Ser. A , vol.449 , pp. 679-683
- Barenco, A.¹

2
- 0001239505
- Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines
- (1982) Internat. J. Theoret. Phys. , vol.21 , pp. 177-201
- Benioff, P.A.¹

3
- 5544255325
- Quantum complexity theory
- (1997) SIAM J. Comput. , vol.26 , pp. 1411-1473
- Bernstein, E.¹ Vazirani, U.²

4
- 0020780139
- Parallel computation for well-endowed rings and space bounded probabilistic machines
- (1983) Inform. and Control , vol.58 , pp. 113-136
- Borodin, A.¹ Cook, S.A.² Pippenger, N.J.³

5
- 0004235580
- Cambridge University Press, Cambridge, UK
- (1991) Combinatorial Matrix Theory
- Brualdi, R.A.¹ Ryser, H.J.²

6
- 0030779417
- Graph orientations with no sink and an approximation for a hard case of #SAT
- Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, 1997 , pp. 248-257
- Bubley, R.¹ Dyer, M.²

7
- 0003824698
- Springer-Verlag, Berlin
- (1996) Algebraic Complexity Theory
- Bürgisser, P.¹ Clausen, M.² Shokrollahi, M.A.³

8
- 0003824697
- Springer-Verlag, Berlin
- (2000) Completeness and Reduction in Algebraic Complexity Theory
- Bürgisser, P.¹

9
- 33645688718
- Sur les determinants gauches
- (1847) Crelle's J. , vol.38 , pp. 93-96
- Cayley, A.¹

10
- 85059770931
- The complexity of theorem proving procedures
- Proceedings of the 3rd ACM Symposium on Theory of Computing, ACM, New York, 1971 , pp. 151-158
- Cook, S.A.¹

11
- 85023205150
- Matrix multiplication via arithmetic progressions
- (1990) J. Symbolic Comput. , vol.9 , pp. 251-280
- Coppersmith, D.¹ Winograd, S.²

12
- 0022421379
- Quantum theory, the Church-Turing principle and the universal quantum computer
- (1985) Proc. Roy. Soc. London Ser. A , vol.400 , pp. 97-117
- Deutsch, D.¹

13
- 0002496370
- Quantum computational networks
- (1989) Proc. Roy. Soc. London Ser. A , vol.425 , pp. 73-90
- Deutsch, D.¹

14
- 0001335519
- Universality of quantum computation
- (1995) Proc. Roy. Soc. London Ser. A , vol.449 , pp. 669-677
- Deutsch, D.¹ Barenco, A.² Ekert, A.³

15
- 33751021446
- Two-bit gates are universal for quantum computation
- (1995) Phys. Rev. A , vol.51 , Issue.3 , pp. 1015-1022
- DiVincenzo, D.P.¹

16
- 0001900109
- Machine models and simulations
- J. van Leeuwen, ed., Elsevier, Amsterdam
- (1990) Handbook of Theoretical Computer Science , vol.A , pp. 1-61
- Van Emde Boas, P.¹

17
- 51249180339
- Simulating physics with computers
- (1982) Internat. J. Theoret. Phys. , vol.21 , pp. 467-488
- Feynman, R.P.¹

18
- 0032597113
- Complexity limitations on quantum computation
- (1999) J. Comput. System Sci. , vol.59 , pp. 240-252
- Fortnow, L.¹ Rogers, J.²

19
- 0031914760
- N/NP, and the quantum field computer
- (1998) Proc. Natl. Acad. Sci. USA , vol.95 , pp. 98-101
- Freedman, M.¹

20
- 0003612002
- quant-ph/9807006
- (1998) The Heisenberg Representation of Quantum Computers
- Gottesman, D.¹

21
- 0029701737
- Fast quantum mechanical algorithm for database search
- Proceedings of the 28th ACM Symposium on Theory of Computing, ACM, New York, 1996 , pp. 212-218
- Grover, L.K.¹

22
- 0025383338
- The complexity of very simple Boolean formulas with applications
- (1990) SIAM J. Comput. , vol.19 , pp. 44-70
- Hunt H.B. III¹ Stearns, R.E.²

23
- 38249043088
- Random generation of combinatorial structures from a uniform distribution
- (1986) Theoret. Comput. Sci. , vol.46 , pp. 169-188
- Jerrum, M.R.¹ Valiant, L.G.² Vazirani, V.V.³

24
- 0002117788
- Computability by probabilistic machines
- C. E. Shannon and J. McCarthy, eds., Princeton University Press, Princeton, NJ
- (1956) Automata Studies , pp. 183-212
- De Leeuw, K.¹ Moore, E.F.² Shannon, C.E.³ Shapiro, N.⁴

25
- 0000182194
- A theorem on Pfaffians
- (1968) J. Combinatorial Theory , vol.5 , pp. 313-319
- Lieb, E.H.¹

26
- 0003641563
- Springer-Verlag, Berlin
- (2000) Matrices and Matroids for Systems Analysis
- Murota, K.¹

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

28
- 0003897694
- Addison-Wesley, Reading, MA
- (1994) Computational Complexity
- Papadimitriou, C.H.¹

29
- 0004060076
- Oxford University Press, New York
- (1997) Quantum Mechanics
- Robinett, R.W.¹

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

31
- 34250487811
- Gaussian elimination is not optimal
- (1968) Numer. Math. , vol.13 , pp. 354-356
- Strassen, V.¹

32
- 0010318139
- Permanent uncertainty: On the quantum evaluation of the determinant and permanent of a matrix
- (1996) Proc. Phys. Comp. , vol.96
- Troyansky, L.¹ Tishby, N.²

33
- 84960561455
- On computable numbers, with an application to the Entscheidungsproblem
- (1936) Proc. Lond. Math. Soc. Ser. 2 , vol.42 , pp. 230-265
- Turing, A.M.¹

34
- 49249151236
- The complexity of computing the permanent
- (1979) Theoret. Comput. Sci. , vol.8 , pp. 189-201
- Valiant, L.G.¹

35
- 85034715651
- Completeness classes in algebra
- Proceedings of the 11th ACM Symposium on Theory of Computing, ACM, New York, 1979 , pp. 249-261
- Valiant, L.G.¹

36
- 0037163969
- Expressiveness of matchgates
- to appear
- Theoret. Comput. Sci.
- Valiant, L.G.¹

37
- 0022911518
- NP is as easy as detecting single solutions
- (1986) Theoret. Comput. Sci. , vol.47 , pp. 85-93
- Valiant, L.G.¹ Vazirani, V.V.²

38
- 0027873262
- Quantum circuit complexity
- IEEE Computer Society, Los Alamitos, CA
- (1993) Proceedings of the 34th Symposium on Foundations of Computer Science , pp. 352-360
- Yao, A.C.-C.¹

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