메뉴 건너뛰기




Volumn 14, Issue , 2012, Pages 636-647

Variable time amplitude amplification and quantum algorithms for linear Algebra problems

Author keywords

Amplitude amplification; Linear equations; Quantum algorithms; Quantum computing

Indexed keywords

ALGORITHM FOR SOLVING; CONDITION NUMBERS; LINEAR ALGEBRA PROBLEMS; QUANTUM ALGORITHMS; QUANTUM AMPLITUDE AMPLIFICATION; QUANTUM COMPUTING; SYSTEM OF EQUATIONS; SYSTEMS OF LINEAR EQUATIONS;

EID: 84880307934     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2012.636     Document Type: Conference Paper
Times cited : (184)

References (17)
  • 1
    • 84927700972 scopus 로고    scopus 로고
    • Quantum search of spatial regions
    • Also quant-ph/0303041
    • S. Aaronson, A. Ambainis, Quantum search of spatial regions. Theory of Computing, 1: 47-79, 2005. Also quant-ph/0303041.
    • (2005) Theory of Computing , vol.1 , pp. 47-79
    • Aaronson, S.1    Ambainis, A.2
  • 2
    • 77953324460 scopus 로고    scopus 로고
    • Quantum search with variable times
    • Earlier version in STACS'08 and quant-ph/0609188
    • A. Ambainis. Quantum search with variable times. Theory of Computing Systems, 47(3): 786-807, 2010. Earlier version in STACS'08 and quant-ph/0609188.
    • (2010) Theory of Computing Systems , vol.47 , Issue.3 , pp. 786-807
    • Ambainis, A.1
  • 5
    • 33846486283 scopus 로고    scopus 로고
    • Efficient quantum algorithms for simulating sparse hamiltonians
    • Also arXiv:quant-ph/0508139
    • D.W. Berry, G. Ahokas, R. Cleve, and B.C. Sanders. Efficient Quantum Algorithms for Simulating Sparse Hamiltonians. Communication in Mathematical Physics, 270(2): 359-371, 2007. Also arXiv:quant-ph/0508139
    • (2007) Communication in Mathematical Physics , vol.270 , Issue.2 , pp. 359-371
    • Berry, D.W.1    Ahokas, G.2    Cleve, R.3    Sanders, B.C.4
  • 9
    • 76349088508 scopus 로고    scopus 로고
    • On the relationship between continuous- and discrete-time quantum walk
    • Also arXiv: 0810.0312
    • A. M. Childs. On the relationship between continuous- and discrete-time quantum walk, Communications in Mathematical Physics, 294: 581-603, 2010. Also arXiv: 0810.0312.
    • (2010) Communications in Mathematical Physics , vol.294 , pp. 581-603
    • Childs, A.M.1
  • 11
    • 58849150248 scopus 로고    scopus 로고
    • The quantum query complexity of the determinant
    • S. Dörn, T. Thierauf. The quantum query complexity of the determinant. Information Processing Letters, 109 (6): 325-328, 2009.
    • (2009) Information Processing Letters , vol.109 , Issue.6 , pp. 325-328
    • Dörn, S.1    Thierauf, T.2
  • 12
    • 0029701737 scopus 로고    scopus 로고
    • A fast quantum mechanical algorithm for database search
    • Also quant-ph/9605043
    • Lov K. Grover. A fast quantum mechanical algorithm for database search. Proceedings of STOC'96, pp. 212-219. Also quant-ph/9605043.
    • Proceedings of STOC'96 , pp. 212-219
    • Grover, L.K.1
  • 13
    • 70349862042 scopus 로고    scopus 로고
    • Quantum algorithm for linear systems of equations
    • Also arxiv: 0811.3171
    • A. Harrow, A. Hassidim, S. Lloyd, Quantum algorithm for linear systems of equations. Physical Review Letters, 15(103): 150502, 2009. Also arxiv: 0811.3171.
    • (2009) Physical Review Letters , vol.15 , Issue.103 , pp. 150502
    • Harrow, A.1    Hassidim, A.2    Lloyd, S.3
  • 15
    • 84961385953 scopus 로고    scopus 로고
    • The hidden subgroup problem and eigenvalue estimation on a quantum computer
    • Also quant-ph/9903071
    • M. Mosca, A. Ekert. The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer. Proceedings of QCQC'98, Lecture Notes in Computer Science, 1509: 174-188, 1998. Also quant-ph/9903071.
    • (1998) Proceedings of QCQC'98, Lecture Notes in Computer Science , vol.1509 , pp. 174-188
    • Mosca, M.1    Ekert, A.2
  • 16
    • 41049114969 scopus 로고    scopus 로고
    • The littlewood - Offord problem and invertibility of random matrices
    • M. Rudelson, R. Vershynin. The Littlewood - Offord problem and invertibility of random matrices. Advances in Mathematics, 218: 600-633, 2008.
    • (2008) Advances in Mathematics , vol.218 , pp. 600-633
    • Rudelson, M.1    Vershynin, R.2
  • 17
    • 0003621102 scopus 로고
    • An introduction to the conjugate gradient method without the agonizing pain
    • Carnegie Mellon University
    • J. Shewchuk. An introduction to the conjugate gradient method without the agonizing pain. Technical Report CMU-CS-94-125, School of Computer Science, Carnegie Mellon University, 1994.
    • (1994) Technical Report CMU-CS-94-125, School of Computer Science
    • Shewchuk, J.1


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