The Computational Complexity of Linear Optics

Scott Aaronson Alex Arkhipov 2013 The Computational Complexity of Linear Optics Theory of Computing 9 4 143–252 10.4086/toc.2013.v009a004 Dorit Aharonov Wim van Dam Julia Kempe Zeph Landau Seth Lloyd Oded Regev 2007 Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation SIAM Journal on Computing 37 166–194 10.1137/S0097539705447323 C. Bennett E. Bernstein G. Brassard U. Vazirani 1997 Strengths and Weaknesses of Quantum Computing SIAM Journal on Computing 26 5 1510–1523 10.1137/S0097539796300933 Robin Blume-Kohout Carlton M. Caves Ivan H. Deutsch 2002 Climbing Mount Scalable: Physical Resource Requirements for a Scalable Quantum Computer Found. Phys. 32 11 1641–1670 10.1023/A:1021471621587 Hamza Bougroura Habib Aissaoui Nicholas Chancellor Viv Kendon 2016 Quantum-walk transport properties on graphene structures Phys. Rev. A 94 062331 10.1103/PhysRevA.94.062331 M. A. Broome A. Fedrizzi B. P. Lanyon I. Kassal A. Aspuru-Guzik A. G. White 2010 Discrete single-photon quantum walks with tunable decoherence Phys. Rev. Lett. 104 153602 10.1103/PhysRevLett.104.153602 K. L. Brown W. J. Munro V. M. Kendon 2010 Using Quantum Computers for Quantum Simulation Entropy 12 11 2268–2307 10.3390/e12112268 A Callison N Chancellor F Mintert V Kendon 2019 Finding spin glass ground states using quantum walks New J. Phys. 21 123022 10.1088/1367-2630/ab5ca2 N. Chancellor 2017 Modernizing Quantum Annealing II: Genetic algorithms with the Inference Primitive Formalism https://arxiv.org/abs/1609.05875 ArXiv:1609.05875 N. Chancellor 2017 Modernizing Quantum Annealing using Local Searches New J. Phys. 19 2 023024 10.1088/1367-2630/aa59c4 Andrew M. Childs 2009 Universal computation by quantum walk Phys. Rev. Lett. 102 180501 10.1103/PhysRevLett.102.180501 Andrew M. Childs Richard Cleve Enrico Deotto Edward Farhi Sam Gutmann Daniel A. Spielman 2003 Exponential algorithmic speedup by a quantum walk Proc. 35th Annual ACM Symposium on Theory of Computing (STOC 2003) Assoc. for Comp. Machinery, New York 59–68 10.1145/780542.780552 Andrew M. Childs Edward Farhi John Preskill 2001 Robustness of adiabatic quantum computation Physical Review A 65 1 012322 10.1103/PhysRevA.65.012322 Andrew M. Childs Jeffrey Goldstone 2004 Spatial search by quantum walk Physical Review A 70 2 022314 10.1103/PhysRevA.70.022314 Andrew M. Childs David Gosset Zak Webb 2013 Universal computation by multi-particle quantum walk Science 339 791–794 10.1126/science.1229957 Vicky Choi 2010 Adiabatic quantum algorithms for the NP-complete Maximum-Weight Independent set, Exact Cover and 3SAT problems https://arxiv.org/abs/1004.2226 ArXiv:1004.2226 A. Ben Dodds Viv Kendon Charles S. Adams Nicholas Chancellor 2019 Practical designs for permutation-symmetric problem Hamiltonians on hypercubes Phys. Rev. A 100 032320 10.1103/PhysRevA.100.032320 A Ekert J Jozsa 1998 Quantum algorithms: entanglement–enhanced information processing Phil. Trans. Royal Soc. A 356 1769–82 10.1098/rsta.1998.0248 E. Farhi J. Goldstone S. Gutmann M. Sipser 2000 Quantum Computation by Adiabatic Evolution http://arxiv.org/quant-ph/abs/0001106 ArXiv:quant-ph/0001106 E Farhi S Gutmann 1998 Quantum computation and decison trees Phys. Rev. A 58 915–928 10.1103/PhysRevA.58.915 A. B. Finilla M. A. Gomez C. Sebenik J. D. Doll 1994 Quantum annealing: A new method for minimizing multidimensional functions Chem. Phys. Lett. 219 343 10.1016/0009-2614(94)00117-0 Lucien Hardy 2001 Quantum theory from five reasonable axioms http://arxiv.org/quant-ph/abs/0101012 ArXiv:quant-ph/0101012 A. Hartwig F. Daske S. Kobe 1984 A recursive branch-and-bound algorithm for the exact ground state of Ising spin-glass models Computer Physics Communications 32 2 133 – 138 10.1016/0010-4655(84)90066-3 C. Horsman S. Stepney R. C. Wagner V. Kendon 2014 When does a Physical System Compute? Proc. Roy. Soc. A 470 2169 20140182 10.1098/rspa.2014.0182 D Horsman V Kendon S Stepney P Young 2017 Abstraction and representation in living organisms: when does a biological system compute? Giovagnoli R Dodig-Crnkovic G Representation and Reality in Humans, Other Living Organisms and Intelligent Machines Studies in Applied Philosophy, Epistemology and Rational Ethics 28 Springer 91–116 10.1007/978-3-319-43784-2_6 Richard I. G. Hughes 1997 Models and representation Philosophy of science 64 S325–S336 10.1086/392611 T. Kadowaki H. Nishimori 1998 Quantum annealing in the transverse Ising model Phys. Rev. E 58 5355 10.1103/PhysRevE.58.5355 Michal Karski Leonid Forster Jai-Min Choi Andreas Steffen Wolfgang Alt Dieter Meschede Artur Widera 2009 Quantum Walk in Position Space with Single Optically Trapped Atoms Science 325 5937 174–177 10.1126/science.1174436 Kempe Kitaev Regev 2004 The Complexity of the Local Hamiltonian Problem K. Lodaya M. Mahajan Proc. 24th FSTTCS LNCS 3328 Springer 372–383 10.1007/978-3-540-30538-5_31 V. Kendon A. Sebald S. Stepney M. Bechmann P. Hines R. C. Wagner 2011 Heterotic computing C.S. Calude J. Kari I. Petre G. Rozenberg Unconventional Computation, LNCS 6714 Springer

Berlin, Heidelberg

113–124 10.1007/978-3-642-21341-0_16 V Kendon A Siebald S Stepney 2015 Heterotic computing: exploiting hybrid computational devices Phil. Trans. Royal Soc. A 373 Royal Society

London, UK

10.1098/rsta.2015.0091 Viv Kendon 2020 How to compute using quantum walks 10.24350/CIRM.V.19600203 CIRM. Audiovisual resource. Daniel Lidar 2019 Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes http://arxiv.org/abs/1904.12028 Bas Lodewijks 2019 Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems http://arxiv.org/abs/1911.08043 N. B. Lovett S. Cooper M. S. Everitt M. Trevers V. Kendon 2010 Universal quantum computation using the discrete time quantum walk Phys. Rev. A 81 042330 10.1103/PhysRevA.81.042330 M. Mohseni P. Rebentrost S. Lloyd A. Aspuru-Guzik 2008 Environment-assisted quantum walks in photosynthetic energy transfer J. Chem. Phys. 129 174106 10.1063/1.3002335 Ashley Montanaro 2018 Quantum-Walk Speedup of Backtracking Algorithms Theory of Computing 14 15 1–24 10.4086/toc.2018.v014a015 Ashley Montanaro 2019 Quantum speedup of branch-and-bound algorithms http://arxiv.org/abs/1906.10375 ArXiv:1906.10375 JG Morley N Chancellor S Bose V Kendon 2019 Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise Phys. Rev. A 99 022339 10.1103/PhysRevA.99.022339 Hagai B. Perets Yoav Lahini Francesca Pozzi Marc Sorel Roberto Morandotti Yaron Silberberg 2008 Realization of quantum walks with negligible decoherence in waveguide lattices Phys. Rev. Lett. 100 170506 10.1103/PhysRevLett.100.170506 Gualtiero Piccinini 2017 Computation in Physical Systems Edward N. Zalta The Stanford Encyclopedia of Philosophy Summer 2017 Stanford University Press http://plato.stanford.edu/archives/sum2017/entries/computation-physicalsystems/ Hilary Putnam 1988 Representation and Reality MIT Press

Cambridge, MA

https://mitpress.mit.edu/books/representation-and-reality ISBN: 9780262161084 Jérémie Roland Nicolas J. Cerf 2002 Quantum search by local adiabatic evolution Phys. Rev. A 65 042308 10.1103/PhysRevA.65.042308 C. A. Ryan M. Laforest J. C. Boileau R. Laflamme 2005 Experimental implementation of discrete time quantum random walk on an NMR quantum information processor Phys. Rev. A 72 062317 10.1103/PhysRevA.72.062317 A. Schreiber K. N. Cassemiro V. Potoček A. Gábris I. Jex Ch. Silberhorn 2011 Decoherence and disorder in quantum walks: From ballistic spread to localization Phys. Rev. Lett. 106 180403 10.1103/PhysRevLett.106.180403 Neil Shenvi Julia Kempe K Birgitta Whaley 2003 A quantum random walk search algorithm Phys. Rev. A 67 052307 10.1103/PhysRevA.67.052307 Steffen vanDam Hogg Breyta Chuang 2003 Experimental implementation of an adiabatic quantum optimization algorithm Phys. Rev. Lett. 90 6 067903 10.1103/PhysRevLett.90.067903 S. Stepney V. Kendon 2019 The role of the representational entity in physical computing UCNC 2019, Tokyo, Japan, June 2019 LNCS 11493 Springer 219–231 10.1007/978-3-030-19311-9_18 K. Wiesner 2009 Quantum Cellular Automata Robert A. Meyers Springer Encyclopedia of Complexity and System Science Cellular Automata, Mathematical Basis of, Ed. Andy Adamatzky Springer 00105 10.1007/978-0-387-30440-3_426 or http://arxiv.org/abs/0808.0679