References analysis of the Wikipedia article "양자 알고리즘" in the Korean version

arxiv.org

Farhi, Edward; Goldstone, Jeffrey; Gutmann, Sam (2008). “A Quantum Algorithm for the Hamiltonian NAND Tree”. 《Theory of Computing》 4: 169–190. arXiv:quant-ph/0702144. doi:10.4086/toc.2008.v004a008.

Childs, Andrew M.; van Dam, W. (2010). “Quantum algorithms for algebraic problems”. 《Reviews of Modern Physics》 82 (1): 1–52. arXiv:0812.0380. Bibcode:2010RvMP...82....1C. doi:10.1103/RevModPhys.82.1.

Shor, P. W. (1997). “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”. 《SIAM Journal on Scientific and Statistical Computing》 26 (5): 1484–1509. arXiv:quant-ph/9508027. Bibcode:1995quant.ph..8027S. doi:10.1137/s0097539795293172.

Lund, A.P.; Laing, A.; Rahimi-Keshari, S.; Rudolph, T.; O'Brien, J.L.; Ralph, T.C. (2014년 9월 5일). “Boson Sampling from Gaussian States”. 《Phys. Rev. Lett.》 113 (10): 100502. arXiv:1305.4346. Bibcode:2014PhRvL.113j0502L. doi:10.1103/PhysRevLett.113.100502. PMID 25238340.

Seshadreesan, Kaushik P.; Olson, Jonathan P.; Motes, Keith R.; Rohde, Peter P.; Dowling, Jonathan P. (2015). “Boson sampling with displaced single-photon Fock states versus single-photon-added coherent states: The quantum-classical divide and computational-complexity transitions in linear optics”. 《Physical Review A》 91 (2): 022334. arXiv:1402.0531. Bibcode:2015PhRvA..91b2334S. doi:10.1103/PhysRevA.91.022334.

Brassard, G.; Hoyer, P.; Tapp, A. (1998). 《Quantum Counting》. Lecture Notes in Computer Science 1443. 820–831쪽. arXiv:quant-ph/9805082. doi:10.1007/BFb0055105. ISBN 978-3-540-64781-2.

Brassard, G.; Hoyer, P.; Mosca, M.; Tapp, A. (2002). 〈Quantum Amplitude Amplification and Estimation〉. Samuel J. Lomonaco, Jr. 《Quantum Computation and Quantum Information》. AMS Contemporary Mathematics 305. 53–74쪽. arXiv:quant-ph/0005055. Bibcode:2000quant.ph..5055B. doi:10.1090/conm/305/05215. ISBN 9780821821404.

Ambainis, A. (2007). “Quantum Walk Algorithm for Element Distinctness”. 《SIAM Journal on Computing》 37 (1): 210–239. arXiv:quant-ph/0311001. doi:10.1137/S0097539705447311.

Magniez, F.; Santha, M.; Szegedy, M. (2007). “Quantum Algorithms for the Triangle Problem”. 《SIAM Journal on Computing》 37 (2): 413–424. arXiv:quant-ph/0310134. doi:10.1137/050643684.

Magniez, F.; Nayak, A. (2007). “Quantum Complexity of Testing Group Commutativity”. 《Algorithmica》 48 (3): 221–232. arXiv:quant-ph/0506265. doi:10.1007/s00453-007-0057-8.

Abrams, D. S.; Lloyd, S. (1997). “Simulation of many-body Fermi systems on a universal quantum computer”. 《Physical Review Letters》 79 (13): 2586–2589. arXiv:quant-ph/9703054. Bibcode:1997PhRvL..79.2586A. doi:10.1103/PhysRevLett.79.2586.

Kassal, I.; Jordan, S. P.; Love, P. J.; Mohseni, M.; Aspuru-Guzik, A. (2008). “Polynomial-time quantum algorithm for the simulation of chemical dynamics”. 《Proceedings of the National Academy of Sciences of the United States of America》 105 (48): 18681–86. arXiv:0801.2986. Bibcode:2008PNAS..10518681K. doi:10.1073/pnas.0808245105. PMC 2596249. PMID 19033207.

Freedman, M.; Kitaev, A.; Wang, Z. (2002). “Simulation of Topological Field Theories by Quantum Computers”. 《Communications in Mathematical Physics》 227 (3): 587–603. arXiv:quant-ph/0001071. Bibcode:2002CMaPh.227..587F. doi:10.1007/s002200200635.

Aharonov, D.; Jones, V.; Landau, Z. (2009). “A polynomial quantum algorithm for approximating the Jones polynomial”. 《Algorithmica》 55 (3): 395–421. arXiv:quant-ph/0511096. doi:10.1007/s00453-008-9168-0.

Wocjan, P.; Yard, J. (2008). “The Jones polynomial: quantum algorithms and applications in quantum complexity theory”. 《Quantum Information and Computation》 8 (1): 147–180. arXiv:quant-ph/0603069. Bibcode:2006quant.ph..3069W. doi:10.26421/QIC8.1-2-10.

Alagic, G.; Jordan, S.P.; König, R.; Reichardt, B. W. (2010). “Approximating Turaev-Viro 3-manifold invariants is universal for quantum computation”. 《Physical Review A》 82 (4): 040302. arXiv:1003.0923. Bibcode:2010PhRvA..82d0302A. doi:10.1103/PhysRevA.82.040302.

Harrow, Aram W; Hassidim, Avinatan; Lloyd, Seth (2008). “Quantum algorithm for solving linear systems of equations”. 《Physical Review Letters》 103 (15): 150502. arXiv:0811.3171. Bibcode:2009PhRvL.103o0502H. doi:10.1103/PhysRevLett.103.150502. PMID 19905613.

Moll, Nikolaj; Barkoutsos, Panagiotis; Bishop, Lev S.; Chow, Jerry M.; Cross, Andrew; Egger, Daniel J.; Filipp, Stefan; Fuhrer, Andreas; Gambetta, Jay M. (2018). “Quantum optimization using variational algorithms on near-term quantum devices”. 《Quantum Science and Technology》 3 (3): 030503. arXiv:1710.01022. Bibcode:2018QS&T....3c0503M. doi:10.1088/2058-9565/aab822.

Peruzzo, Alberto; McClean, Jarrod; Shadbolt, Peter; Yung, Man-Hong; Zhou, Xiao-Qi; Love, Peter J.; Aspuru-Guzik, Alán; O’Brien, Jeremy L. (2014년 7월 23일). “A variational eigenvalue solver on a photonic quantum processor”. 《Nature Communications》 (영어) 5 (1): 4213. arXiv:1304.3061. Bibcode:2014NatCo...5.4213P. doi:10.1038/ncomms5213. ISSN 2041-1723. PMC 4124861. PMID 25055053.

Higgott, Oscar; Wang, Daochen; Brierley, Stephen (2019). “Variational Quantum Computation of Excited States”. 《Quantum》 3: 156. arXiv:1805.08138. doi:10.22331/q-2019-07-01-156.

Smart, Scott; Mazziotti, David (2021년 2월 18일). “Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices”. 《Phys. Rev. Lett.》 (영어) 125 (7): 070504. arXiv:2004.11416. Bibcode:2021PhRvL.126g0504S. doi:10.1103/PhysRevLett.126.070504. PMID 33666467.

doi.org

dx.doi.org

Ralph, T.C. (July 2013). “Figure 1: The boson-sampling problem”. 《Nature Photonics》 (Nature) 7 (7): 514–515. doi:10.1038/nphoton.2013.175. 2014년 9월 12일에 확인함.

Brassard, G.; Hoyer, P.; Tapp, A. (1998). 《Quantum Counting》. Lecture Notes in Computer Science 1443. 820–831쪽. arXiv:quant-ph/9805082. doi:10.1007/BFb0055105. ISBN 978-3-540-64781-2.

Ambainis, A. (2007). “Quantum Walk Algorithm for Element Distinctness”. 《SIAM Journal on Computing》 37 (1): 210–239. arXiv:quant-ph/0311001. doi:10.1137/S0097539705447311.

Ambainis, A. (2005). “Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range”. 《Theory of Computing》 1 (1): 37–46. doi:10.4086/toc.2005.v001a003.

Kutin, S. (2005). “Quantum Lower Bound for the Collision Problem with Small Range”. 《Theory of Computing》 1 (1): 29–36. doi:10.4086/toc.2005.v001a002.

Magniez, F.; Santha, M.; Szegedy, M. (2007). “Quantum Algorithms for the Triangle Problem”. 《SIAM Journal on Computing》 37 (2): 413–424. arXiv:quant-ph/0310134. doi:10.1137/050643684.

Pak, Igor (2012). “Testing commutativity of a group and the power of randomization”. 《LMS Journal of Computation and Mathematics》 15: 38–43. doi:10.1112/S1461157012000046.

Magniez, F.; Nayak, A. (2007). “Quantum Complexity of Testing Group Commutativity”. 《Algorithmica》 48 (3): 221–232. arXiv:quant-ph/0506265. doi:10.1007/s00453-007-0057-8.

Feynman, R. P. (1982). “Simulating physics with computers”. 《International Journal of Theoretical Physics》 21 (6–7): 467–488. Bibcode:1982IJTP...21..467F. doi:10.1007/BF02650179.

Higgott, Oscar; Wang, Daochen; Brierley, Stephen (2019). “Variational Quantum Computation of Excited States”. 《Quantum》 3: 156. arXiv:1805.08138. doi:10.22331/q-2019-07-01-156.

Mazziotti, David (2006년 10월 6일). “Anti-Hermitian Contracted Schrödinger Equation: Direct Determination of the Two-Electron Reduced Density Matrices of Many-Electron Molecules”. 《Phys. Rev. Lett.》 (영어) 97 (14): 143002. Bibcode:2006PhRvL..97n3002M. doi:10.1103/PhysRevLett.97.143002. PMID 17155245.

harvard.edu

adsabs.harvard.edu

Feynman, R. P. (1982). “Simulating physics with computers”. 《International Journal of Theoretical Physics》 21 (6–7): 467–488. Bibcode:1982IJTP...21..467F. doi:10.1007/BF02650179.

nih.gov

ncbi.nlm.nih.gov

양자 알고리즘 (Korean Wikipedia)

archive.org

arxiv.org

books.google.com

doi.org

dx.doi.org

harvard.edu

adsabs.harvard.edu

ibm.com

quantum-computing.ibm.com

nature.com

nih.gov

ncbi.nlm.nih.gov

phys.org

scottaaronson.com

web.archive.org

worldcat.org