Quantum Algorithms for Scientific Computing and Approximate Optimization
暂无分享,去创建一个
[1] E. Clementi,et al. Computation of large molecules with the hartree-fock model. , 1972, Proceedings of the National Academy of Sciences of the United States of America.
[2] Adam D. Bookatz. QMA-complete problems , 2012, Quantum Inf. Comput..
[3] J. Whitfield,et al. Simulating chemistry using quantum computers. , 2010, Annual review of physical chemistry.
[4] P. Love. Back to The Future: A Roadmap for Quantum Simulation From Vintage Quantum Chemistry , 2012, 1208.5524.
[5] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[6] J. Preskill. Work: Quantum Information and Computation , 1998 .
[7] Michele Mosca. Quantum Algorithms , 2009, Encyclopedia of Complexity and Systems Science.
[8] G. Weiss,et al. EIGENFUNCTION EXPANSIONS. Associated with Second-order Differential Equations. Part I. , 1962 .
[9] David Zuckerman,et al. On Unapproximable Versions of NP-Complete Problems , 1996, SIAM J. Comput..
[10] Vahid Lotfi,et al. A graph coloring algorithm for large scale scheduling problems , 1986, Comput. Oper. Res..
[11] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[12] M. Sipser,et al. Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.
[13] Andrew M. Childs,et al. Limitations on the simulation of non-sparse Hamiltonians , 2009, Quantum Inf. Comput..
[14] N. Hatano,et al. Finding Exponential Product Formulas of Higher Orders , 2005, math-ph/0506007.
[15] B. Lanyon,et al. Towards quantum chemistry on a quantum computer. , 2009, Nature chemistry.
[16] Andrew M. Childs,et al. The Bose-Hubbard Model is QMA-complete , 2015, Theory Comput..
[17] Andrew M. Childs,et al. Black-box hamiltonian simulation and unitary implementation , 2009, Quantum Inf. Comput..
[18] E. Villaseñor. Introduction to Quantum Mechanics , 2008, Nature.
[19] Chi Zhang,et al. A fast algorithm for approximating the ground state energy on a quantum computer , 2010, Math. Comput..
[20] John Watrous,et al. Quantum Computational Complexity , 2008, Encyclopedia of Complexity and Systems Science.
[21] R. Feynman. Simulating physics with computers , 1999 .
[22] Siam J. CoMPtrr,et al. FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .
[23] Umesh V. Vazirani,et al. Quantum Complexity Theory , 1997, SIAM J. Comput..
[24] Vasil S. Denchev,et al. Computational multiqubit tunnelling in programmable quantum annealers , 2015, Nature Communications.
[25] John Preskill,et al. Quantum computing and the entanglement frontier , 2012, 1203.5813.
[26] Christian Schaffner,et al. Quantum cryptography beyond quantum key distribution , 2015, Designs, Codes and Cryptography.
[27] John Preskill,et al. Quantum computation of scattering in scalar quantum field theories , 2011, Quantum Inf. Comput..
[28] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[29] Michel Deza,et al. Applications of cut polyhedra—II , 1994 .
[30] Ralph E. Christoffersen,et al. Ab Initio Calculations on Large Molecules , 1972 .
[31] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[32] Luis Miguel Nieto,et al. A quantum architecture for multiplying signed integers , 2008 .
[33] Israel Michael Sigal,et al. Introduction to Spectral Theory: With Applications to Schrödinger Operators , 1995 .
[34] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[35] Jacob biamonte,et al. Quantum machine learning , 2016, Nature.
[36] A. Papageorgiou,et al. On the complexity of the multivariate Sturm-Liouville eigenvalue problem , 2007, J. Complex..
[37] Christof Zalka. Efficient Simulation of Quantum Systems by Quantum Computers , 1996, quant-ph/9603026.
[38] Charles H. Bennett. Time/Space Trade-Offs for Reversible Computation , 1989, SIAM J. Comput..
[39] Yasuhiro Takahashi,et al. A fast quantum circuit for addition with few qubits , 2008, Quantum Inf. Comput..
[40] Stuart Hadfield,et al. Quantum algorithms and circuits for scientific computing , 2015, Quantum Inf. Comput..
[41] Rajeev Motwani,et al. On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[42] R. V. Meter,et al. Fast quantum modular exponentiation , 2004, quant-ph/0408006.
[43] Endre Boros,et al. Pseudo-Boolean optimization , 2002, Discret. Appl. Math..
[44] Stuart Hadfield,et al. Divide and conquer approach to quantum Hamiltonian simulation , 2017 .
[45] P. Brandimarte. Finite Difference Methods for Partial Differential Equations , 2006 .
[46] S. Braunstein,et al. Quantum computation , 1996 .
[47] Jeremy Frank,et al. Compiling quantum circuits to realistic hardware architectures using temporal planners , 2017, ArXiv.
[48] S. Poljak,et al. A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem , 1982, Canadian Journal of Mathematics.
[49] A. Klappenecker,et al. Discrete cosine transforms on quantum computers , 2001, ISPA 2001. Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis. In conjunction with 23rd International Conference on Information Technology Interfaces (IEEE Cat..
[50] Mihalis Yannakakis,et al. Node-and edge-deletion NP-complete problems , 1978, STOC.
[51] J. J. Sakurai,et al. Modern Quantum Mechanics, Revised Edition , 1995 .
[52] Hans F. Weinberger,et al. Upper and lower bounds for eigenvalues by finite difference methods , 1956 .
[53] J. Traub. Iterative Methods for the Solution of Equations , 1982 .
[54] Andrew Lucas,et al. Ising formulations of many NP problems , 2013, Front. Physics.
[55] Ashley Montanaro,et al. Quantum boolean functions , 2008, Chic. J. Theor. Comput. Sci..
[56] Shengyu Zhang,et al. Several natural BQP-Complete problems , 2006, quant-ph/0606179.
[57] Dorit Aharonov,et al. Quantum NP - A Survey , 2002, quant-ph/0210077.
[58] Matthew B. Hastings,et al. Improving quantum algorithms for quantum chemistry , 2014, Quantum Inf. Comput..
[59] Tad Hogg,et al. Quantum optimization , 2000, Inf. Sci..
[60] R. Shankar,et al. Principles of Quantum Mechanics , 2010 .
[61] S. Gustafson,et al. Mathematical Concepts of Quantum Mechanics , 2006, Universitext.
[62] B. Sanders,et al. Quantum-circuit design for efficient simulations of many-body quantum dynamics , 2011, 1108.4318.
[63] Matthew Roughan,et al. The Multilevel Splitting algorithm for graph colouring with application to the Potts model , 2017 .
[64] Gene H. Golub,et al. Matrix computations , 1983 .
[65] E. Farhi,et al. A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem , 2014, 1412.6062.
[66] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[67] Martin Rötteler,et al. Reversible circuit compilation with space constraints , 2015, ArXiv.
[68] Paul M. B. Vitányi. How well can a graph be n-colored? , 1981, Discret. Math..
[69] Richard Beigel,et al. The polynomial method in circuit complexity , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[70] F. Verstraete,et al. Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space. , 2011, Physical review letters.
[71] Catherine C. McGeoch. Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice , 2014, Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice.
[72] Thomas G. Draper,et al. A logarithmic-depth quantum carry-lookahead adder , 2006, Quantum Inf. Comput..
[73] Miklós Rédei. John von Neumann - selected letters , 2006, History of mathematics.
[74] Lov K. Grover. Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.
[75] M. Hastings,et al. Solving strongly correlated electron models on a quantum computer , 2015, 1506.05135.
[76] J. Whitfield,et al. Simulation of electronic structure Hamiltonians using quantum computers , 2010, 1001.3855.
[77] S. Braunstein,et al. Quantum computation over continuous variables , 1998 .
[78] David Poulin,et al. The Trotter step size required for accurate quantum simulation of quantum chemistry , 2014, Quantum Inf. Comput..
[79] Bryan O'Gorman,et al. A case study in programming a quantum annealer for hard operational planning problems , 2014, Quantum Information Processing.
[80] P. Hohenberg,et al. Inhomogeneous electron gas , 1964 .
[81] P. Høyer,et al. Higher order decompositions of ordered operator exponentials , 2008, 0812.0562.
[82] Barry C. Sanders,et al. Simulating quantum dynamics on a quantum computer , 2010, 1011.3489.
[83] Alán Aspuru-Guzik,et al. Faster quantum chemistry simulation on fault-tolerant quantum computers , 2012 .
[84] Annie Y. Wei,et al. Exponentially more precise quantum simulation of fermions in second quantization , 2015, 1506.01020.
[85] Juraj Hromkovic,et al. Algorithmics for hard problems - introduction to combinatorial optimization, randomization, approximation, and heuristics , 2001 .
[86] E. Farhi,et al. A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.
[87] D. Deutsch. Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[88] David P. Williamson,et al. The Design of Approximation Algorithms , 2011 .
[89] Stuart Hadfield,et al. On the Representation of Boolean and Real Functions as Hamiltonians for Quantum Computing , 2018, ACM Transactions on Quantum Computing.
[90] P. Love,et al. The Bravyi-Kitaev transformation for quantum computation of electronic structure. , 2012, The Journal of chemical physics.
[91] Ashley Montanaro,et al. Quantum algorithms: an overview , 2015, npj Quantum Information.
[92] Desh Ranjan,et al. Quantifiers and approximation , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.
[93] Andrew M. Childs,et al. Quantum information processing in continuous time , 2004 .
[94] E. Knill,et al. Simulating physical phenomena by quantum networks , 2001, quant-ph/0108146.
[95] F. Barahona. The max-cut problem on graphs not contractible to K5 , 1983 .
[96] J. Cullum,et al. Lanczos algorithms for large symmetric eigenvalue computations , 1985 .
[97] Nathan Linial,et al. The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[98] Anargyros Papageorgiou,et al. Quantum Algorithms for Continuous Problems and Their Applications , 2014 .
[99] Todd A. Brun,et al. Quantum Error Correction , 2019, Oxford Research Encyclopedia of Physics.
[100] Gerald B. Folland,et al. Real Analysis: Modern Techniques and Their Applications , 1984 .
[101] H. Neven,et al. Characterizing quantum supremacy in near-term devices , 2016, Nature Physics.
[102] Edward Farhi,et al. Finding cliques by quantum adiabatic evolution , 2002, Quantum Inf. Comput..
[103] S. Goedecker. Linear scaling electronic structure methods , 1999 .
[104] Randall J. LeVeque,et al. Finite difference methods for ordinary and partial differential equations - steady-state and time-dependent problems , 2007 .
[105] Ryan O'Donnell,et al. Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..
[106] Steven Givant,et al. Introduction to Boolean Algebras , 2008 .
[107] Hanno Lefmann,et al. A combinatorial design approach to MAXCUT , 1996, Random Struct. Algorithms.
[108] J. Almlöf,et al. Principles for a direct SCF approach to LICAO–MOab‐initio calculations , 1982 .
[109] Andrew M. Childs,et al. Exponential improvement in precision for simulating sparse Hamiltonians , 2013, Forum of Mathematics, Sigma.
[110] Anargyros Papageorgiou,et al. Measures of quantum computing speedup , 2013, 1307.7488.
[111] S. Aaronson. Read the fine print , 2015, Nature Physics.
[112] Rupak Biswas,et al. Quantum Approximate Optimization with Hard and Soft Constraints , 2017 .
[113] Dmitrij Rappoport,et al. Density functional methods for excited states: equilibrium structure and electronic spectra , 2005 .
[114] Seth Lloyd,et al. Adiabatic quantum computation is equivalent to standard quantum computation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[115] M. Suzuki,et al. Fractal decomposition of exponential operators with applications to many-body theories and Monte Carlo simulations , 1990 .
[116] Jeremy Frank,et al. Parametrized Families of Hard Planning Problems from Phase Transitions , 2014, AAAI.
[117] Yasuhiro Takahashi,et al. Quantum addition circuits and unbounded fan-out , 2009, Quantum Inf. Comput..
[118] Vangelis Th. Paschos,et al. Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness , 2005, Theor. Comput. Sci..
[119] A. Kitaev,et al. Fermionic Quantum Computation , 2000, quant-ph/0003137.
[120] Amnon Ta-Shma,et al. Adiabatic quantum state generation and statistical zero knowledge , 2003, STOC '03.
[121] Alan T. Sherman,et al. A Note on Bennett's Time-Space Tradeoff for Reversible Computation , 1990, SIAM J. Comput..
[122] D. Abrams,et al. Simulation of Many-Body Fermi Systems on a Universal Quantum Computer , 1997, quant-ph/9703054.
[123] Erez Petrank. The hardness of approximation: Gap location , 2005, computational complexity.
[124] M. Head‐Gordon,et al. Simulated Quantum Computation of Molecular Energies , 2005, Science.
[125] Andrew M. Childs,et al. Quantum algorithms for algebraic problems , 2008, 0812.0380.
[126] Óscar Promio Muñoz. Quantum Annealing in the transverse Ising Model , 2018 .
[127] Magnús M. Hallórsson. A still better performance guarantee for approximate graph coloring , 1993 .
[128] Alán Aspuru-Guzik,et al. Quantum algorithm for obtaining the energy spectrum of molecular systems. , 2008, Physical chemistry chemical physics : PCCP.
[129] Daniel A. Lidar,et al. Adiabatic quantum computation , 2016, 1611.04471.
[130] H. Briegel,et al. Measurement-based quantum computation , 2009, 0910.1116.
[131] E. Rieffel,et al. Near-optimal quantum circuit for Grover's unstructured search using a transverse field , 2017, 1702.02577.
[132] S. Lloyd,et al. Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors , 1998, quant-ph/9807070.
[133] Yoshimi Saito,et al. Eigenfunction Expansions Associated with Second-order Differential Equations for Hilbert Space-valued Functions , 1971 .
[134] Endre Boros,et al. New algorithms for quadratic unconstrained binary optimization (qubo) with applications in engineering and social sciences , 2008 .
[135] Andrew M. Childs,et al. Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[136] F. Verstraete,et al. Computational complexity of interacting electrons and fundamental limitations of density functional theory , 2007, 0712.0483.
[137] Stuart Hadfield,et al. Approximating ground and excited state energies on a quantum computer , 2015, Quantum Information Processing.
[138] E. Farhi,et al. A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.
[139] George Karakostas,et al. A better approximation ratio for the vertex cover problem , 2005, TALG.
[140] G. Strang,et al. An Analysis of the Finite Element Method , 1974 .
[141] Stuart Hadfield,et al. The Quantum Approximation Optimization Algorithm for MaxCut: A Fermionic View , 2017, 1706.02998.
[142] David P. DiVincenzo,et al. The complexity of stoquastic local Hamiltonian problems , 2006, Quantum Inf. Comput..
[143] Luca Trevisan,et al. Inapproximability of Combinatorial Optimization Problems , 2004, Electron. Colloquium Comput. Complex..
[144] Julia Kempe,et al. The Complexity of the Local Hamiltonian Problem , 2004, FSTTCS.
[145] Mihalis Yannakakis,et al. The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..
[146] Alán Aspuru-Guzik,et al. A variational eigenvalue solver on a photonic quantum processor , 2013, Nature Communications.
[147] Frank Verstraete,et al. Quantum circuits for strongly correlated quantum systems , 2008, ArXiv.
[148] Igor L. Markov,et al. Synthesis and optimization of reversible circuits—a survey , 2011, CSUR.
[149] Ryan Babbush,et al. What is the Computational Value of Finite Range Tunneling , 2015, 1512.02206.
[150] Noga Alon,et al. Bipartite subgraphs of integer weighted graphs , 1998, Discret. Math..
[151] Pierluigi Crescenzi,et al. A short guide to approximation preserving reductions , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.
[152] E. Rieffel,et al. Quantum Computing: A Gentle Introduction , 2011 .
[153] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[154] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.
[155] James Demmel,et al. Applied Numerical Linear Algebra , 1997 .
[156] Daniel A. Lidar,et al. Evidence for quantum annealing with more than one hundred qubits , 2013, Nature Physics.
[157] R. Cleve,et al. Efficient Quantum Algorithms for Simulating Sparse Hamiltonians , 2005, quant-ph/0508139.
[158] Noam Nisan,et al. Constant depth circuits, Fourier transform, and learnability , 1993, JACM.
[159] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[160] Andrew M. Childs,et al. Simulating Hamiltonian dynamics with a truncated Taylor series. , 2014, Physical review letters.
[161] Shankar M. Venkatesan,et al. Approximation and Intractability Results for the Maximum Cut Problem and its Variants , 1991, IEEE Trans. Computers.
[162] M. Halldórsson. A Still Better Performance Guarantee for Approximate Graph Coloring , 1993, Inf. Process. Lett..
[163] P. Orponen,et al. On Approximation Preserving Reductions: Complete Problems and Robust Measures (Revised Version) , 1987 .
[164] Nathan Wiebe,et al. Hamiltonian simulation using linear combinations of unitary operations , 2012, Quantum Inf. Comput..
[165] Ryan O'Donnell,et al. Analysis of Boolean Functions , 2014, ArXiv.
[166] Panos M. Pardalos,et al. Randomized heuristics for the Max-Cut problem , 2002, Optim. Methods Softw..
[167] Dharmendra S. Modha,et al. Reversible arithmetic coding for quantum data compression , 2000, IEEE Trans. Inf. Theory.
[168] Alán Aspuru-Guzik,et al. Exploiting Locality in Quantum Computation for Quantum Chemistry. , 2014, The journal of physical chemistry letters.
[169] M. Hastings,et al. Gate count estimates for performing quantum chemistry on small quantum computers , 2013, 1312.1695.
[170] Dániel Marx,et al. RAPH COLORING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING , 2022 .
[171] M. Suzuki,et al. Generalized Trotter's formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems , 1976 .
[172] Barenco,et al. Quantum networks for elementary arithmetic operations. , 1995, Physical review. A, Atomic, molecular, and optical physics.
[173] Chi Zhang,et al. On the efficiency of quantum algorithms for Hamiltonian simulation , 2010, Quantum Information Processing.
[174] E. Lieb,et al. Two Soluble Models of an Antiferromagnetic Chain , 1961 .
[175] Endre Boros,et al. Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO) , 2007, J. Heuristics.
[176] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[177] Rainer Steinwandt,et al. Quantum circuits for F2n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {F}}_{2^{n}}$$\end{document}-multipli , 2015, Quantum Information Processing.
[178] Hartmut Neven,et al. Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle , 2016, ArXiv.
[179] Preskill,et al. Efficient networks for quantum factoring. , 1996, Physical review. A, Atomic, molecular, and optical physics.
[180] T. C. E. Cheng,et al. Single machine scheduling to minimize total weighted tardiness , 2005, Eur. J. Oper. Res..
[181] Hans F. Weinberger,et al. Lower bounds for higher eigenvalues by finite difference methods. , 1958 .
[182] Mikhail Smelyanskiy,et al. Practical optimization for hybrid quantum-classical algorithms , 2017, 1701.01450.
[183] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[184] A. Szabó,et al. Modern quantum chemistry : introduction to advanced electronic structure theory , 1982 .
[185] C. Lubich,et al. Error Bounds for Exponential Operator Splittings , 2000 .
[186] Ronald de Wolf,et al. A Brief Introduction to Fourier Analysis on the Boolean Cube , 2008, Theory Comput..
[187] Amnon Ta-Shma,et al. Inverting well conditioned matrices in quantum logspace , 2013, STOC '13.
[188] Alán Aspuru-Guzik,et al. On the Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation , 2014, 1410.8159.
[189] Ashwin Nayak,et al. Interacting boson problems can be QMA hard. , 2009, Physical review letters.
[190] Thomas G. Draper,et al. A new quantum ripple-carry addition circuit , 2004, quant-ph/0410184.
[191] A. U.S.,et al. Simulating Quantum Mechanics on a Quantum Computer ∗ , 1997 .
[192] J. Traub,et al. Quantum algorithm and circuit design solving the Poisson equation , 2012, 1207.2485.
[193] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[194] Rupak Biswas,et al. A NASA perspective on quantum computing: Opportunities and challenges , 2017, Parallel Comput..
[195] Uriel Feige,et al. Approximating Maximum Clique by Removing Subgraphs , 2005, SIAM J. Discret. Math..
[196] M. Suzuki,et al. General theory of fractal path integrals with applications to many‐body theories and statistical physics , 1991 .
[197] Martin Grötschel,et al. An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..
[198] Itay Hen,et al. Driver Hamiltonians for constrained optimization in quantum annealing , 2016, 1602.07942.
[199] Vojtech Rödl,et al. The algorithmic aspects of the regularity lemma , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[200] M. Victor Wickerhauser,et al. Adapted wavelet analysis from theory to software , 1994 .
[201] T. H. Dunning. Gaussian Basis Functions for Use in Molecular Calculations. III. Contraction of (10s6p) Atomic Basis Sets for the First‐Row Atoms , 1970 .
[202] Anargyros Papageorgiou,et al. Estimating the ground state energy of the Schrödinger equation for convex potentials , 2013, J. Complex..
[203] H. Neven,et al. Quantum Algorithms for Fixed Qubit Architectures , 2017, 1703.06199.
[204] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[205] E. Knill,et al. Quantum algorithms for fermionic simulations , 2000, cond-mat/0012334.
[206] Itay Hen,et al. Quantum Annealing for Constrained Optimization , 2015, 1508.04212.
[207] J. Olsen,et al. Molecular electronic-structure theory , 2000 .
[208] E. Tosatti,et al. Quantum annealing of the traveling-salesman problem. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[209] J. Pople,et al. Self‐Consistent Molecular‐Orbital Methods. I. Use of Gaussian Expansions of Slater‐Type Atomic Orbitals , 1969 .
[210] R. Jozsa. Quantum algorithms , 2001 .
[211] J. Cullum,et al. Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. 1 , 2002 .
[212] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[213] Marco Lanzagorta,et al. Quantum Simulators , 2013 .
[214] Yasuhiro Takahashi,et al. A linear-size quantum circuit for addition with no ancillary qubits , 2005, Quantum Inf. Comput..
[215] Jakub Višňák,et al. Quantum algorithms for computational nuclear physics , 2015 .
[216] Peter J. Love,et al. Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix , 2013, 1312.2579.
[217] Alan M. Frieze,et al. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.
[218] Rupak Biswas,et al. From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz , 2017, Algorithms.
[219] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[220] Seth Lloyd,et al. Universal Quantum Simulators , 1996, Science.
[221] Richard Cleve,et al. Exponential improvement in precision for Hamiltonian-evolution simulation , 2013 .
[222] Gregory J. Chaitin,et al. Register allocation & spilling via graph coloring , 1982, SIGPLAN '82.
[223] Andrew Chi-Chih Yao,et al. Quantum Circuit Complexity , 1993, FOCS.
[224] Peter Brucker,et al. Scheduling Algorithms , 1995 .
[225] B. Parlett. The Symmetric Eigenvalue Problem , 1981 .
[226] Magnús M. Halldórsson,et al. Approximating discrete collections via local improvements , 1995, SODA '95.
[227] Noam Nisan,et al. On the degree of boolean functions as real polynomials , 1992, STOC '92.
[228] D. Deutsch. Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[229] A. Harrow,et al. Quantum Supremacy through the Quantum Approximate Optimization Algorithm , 2016, 1602.07674.
[230] A. Harrow,et al. Quantum algorithm for linear systems of equations. , 2008, Physical review letters.
[231] Enrico Bocchieri,et al. Fixed-Point Arithmetic , 2008 .
[232] Marek Karpinski,et al. Improved approximation of Max-Cut on graphs of bounded degree , 2002, J. Algorithms.
[233] Eyob A. Sete,et al. A functional architecture for scalable quantum computing , 2016, 2016 IEEE International Conference on Rebooting Computing (ICRC).
[234] M. Troyer,et al. Elucidating reaction mechanisms on quantum computers , 2016, Proceedings of the National Academy of Sciences.
[235] I. Kassal,et al. Polynomial-time quantum algorithm for the simulation of chemical dynamics , 2008, Proceedings of the National Academy of Sciences.
[236] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[237] Gustavo E. Scuseria,et al. A quantitative study of the scaling properties of the Hartree–Fock method , 1995 .
[238] Christof Zalka. Simulating quantum systems on a quantum computer , 1996, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[239] Celina M. H. de Figueiredo,et al. Reversible Karatsuba's Algorithm , 2006, J. Univers. Comput. Sci..
[240] G. Brassard,et al. Quantum Amplitude Amplification and Estimation , 2000, quant-ph/0005055.
[241] Thomas G. Draper. Addition on a Quantum Computer , 2000, quant-ph/0008033.
[242] Fabián A. Chudak,et al. The Ising model : teaching an old problem new tricks , 2010 .
[243] Andrew M. Childs,et al. Simulating Sparse Hamiltonians with Star Decompositions , 2010, TQC.
[244] Martin Rötteler,et al. Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits , 2014, Quantum Inf. Comput..
[245] Tim Byrnes,et al. Simulating lattice gauge theories on a quantum computer (熱場の量子論とその応用) , 2006 .
[246] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[247] Peter Woit,et al. Quantum Theory, Groups and Representations: An Introduction (under construction) , 2016 .
[248] J. Preskill,et al. Quantum Algorithms for Fermionic Quantum Field Theories , 2014, 1404.7115.
[249] M. Hastings,et al. Training A Quantum Optimizer , 2016, 1605.05370.
[250] Prasad Raghavendra,et al. Beating the random assignment on constraint satisfaction problems of bounded degree , 2015, Electron. Colloquium Comput. Complex..