Fetching the paper…
Reading the bibliography…
Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation.
1901
Earlier work this paper cites.
1902
Earlier work this paper cites.
1904
Earlier work this paper cites.
1904
Earlier work this paper cites.
Ronald de Wolf, “Quantum computing: Lecture notes,” (2023), arXiv:1907.09415 [quant-ph]
1907
Earlier work this paper cites.
1907
Earlier work this paper cites.
1908
Earlier work this paper cites.
1911
Earlier work this paper cites.
M. Born and V. Fock, “Beweis des Adiabatensatzes,” Zeitschrift fur Physik 51
1928
Earlier work this paper cites.
William Karush, Minima of Functions of Several Variables with Inequalities as Side Conditions , Master’s thesis, Department of Mathematics, University of Chicago, Chicago, IL, USA (1939)
1939
Earlier work this paper cites.
F. A. Hayek, “The use of knowledge in society,” The American Economic Review 35
1945
Earlier work this paper cites.
John von Neumann and H. H. Goldstine, “Numerical inverting of matrices of high order,” Bulletin of the American Mathematical Society 53
1947
Earlier work this paper cites.
Seunghoon Lee, Joonho Lee, Huanchen Zhai, Yu Tong, Alexander M. Dalzell, Ashutosh Kumar, Phillip Helms, Johnnie Gray, Zhi-Hao Cui, Wenyuan Liu, Michael Kastoryano, Ryan Babbush, John Preskill, David R. Reichman, Earl T. Campbell, Edward F. Valeev, Lin Lin, and Garnet Kin-Lic Chan, “Evaluating the evidence for exponential quantum advantage in ground-state quantum chemistry,” Nature Communications 14
1952
Earlier work this paper cites.
Harry Markowitz, “Portfolio selection,” The Journal of Finance 7
1952
Earlier work this paper cites.
Nicholas Metropolis, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller, and Edward Teller, “Equation of state calculations by fast computing machines,” The Journal of Chemical Physics 21
1953
Earlier work this paper cites.
Eugene P. Wigner, “Characteristic vectors of bordered matrices with infinite dimensions,” Annals of Mathematics 62
1955
Earlier work this paper cites.
Hale F Trotter, “On the product of semi-groups of operators,” Proceedings of the American Mathematical Society 10
1959
Earlier work this paper cites.
George B Dantzig and Philip Wolfe, “Decomposition principle for linear programs,” Operations research 8
1960
Earlier work this paper cites.
Richard Bellman, “Dynamic programming treatment of the travelling salesman problem,” J. ACM 9
1962
Earlier work this paper cites.
Michael Held and Richard M. Karp, “A Dynamic Programming Approach to Sequencing Problems,” Journal of the Society for Industrial and Applied Mathematics 10
1962
Earlier work this paper cites.
W. K. Hastings, “Monte Carlo sampling methods using Markov chains and their applications,” Biometrika 57
1970
Earlier work this paper cites.
Richard M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations (Springer US, 1972) pp. 85–103
1972
Earlier work this paper cites.
Robert C. Merton, “An analytic derivation of the efficient portfolio frontier,” The Journal of Financial and Quantitative Analysis 7
1972
Earlier work this paper cites.
Fishcer Black and Myron Scholes, “The pricing of options and corporate liabilities,” Journal of political economy 81
1973
Earlier work this paper cites.
David S. Johnson, “Approximation algorithms for combinatorial problems,” Journal of Computer and System Sciences 9
1974
Earlier work this paper cites.
Robert A Wagner and Michael J Fischer, “The string-to-string correction problem,” Journal of the ACM (JACM) 21
1974
Earlier work this paper cites.
Leslie G Valiant, “The complexity of computing the permanent,” Theoretical computer science 8
1979
Earlier work this paper cites.
C. L. Lawson, R. J. Hanson, D. R. Kincaid, and F. T. Krogh, “Basic linear algebra subprograms for fortran usage,” ACM Trans. Math. Softw. 5
1979
Earlier work this paper cites.
A. S. Holevo, “On capacity of a quantum communications channel,” Problems of Information Transmission 15
1979
Earlier work this paper cites.
Jack J Dongarra, Cleve Barry Moler, James R Bunch, and Gilbert W Stewart, LINPACK users’ guide (SIAM, 1979)
1979
Earlier work this paper cites.
D. de Werra, “Scheduling in sports,” in Annals of Discrete Mathematics (11) , North-Holland Mathematics Studies, Vol. 59, edited by P. Hansen (North-Holland, 1981) pp. 381–395
1981
Earlier work this paper cites.
Francisco Barahona, “On the computational complexity of ising spin glass models,” Journal of Physics A: Mathematical and General 15
1982
Earlier work this paper cites.
Larry Stockmeyer, “The complexity of approximate counting,” in Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC ’83 , STOC ’83 (ACM Press, 1983)
1983
Earlier work this paper cites.
Scott Kirkpatrick, C Daniel Gelatt, and Mario P Vecchi, “Optimization by simulated annealing,” Science 220
1983
Earlier work this paper cites.
Gary Chamberlain and Michael Rothschild, “Arbitrage, factor structure, and mean-variance analysis on large asset markets,” Econometrica 51
1983
Earlier work this paper cites.
Stuart Geman and Donald Geman, “Stochastic relaxation, gibbs distributions, and the bayesian restoration of images,” IEEE Trans. Pattern Anal. Mach. Intell. PAMI-6
1984
Earlier work this paper cites.
Christos H. Papadimitriou, “Games against nature,” Journal of Computer and System Sciences 31
1985
Earlier work this paper cites.
Tim Bollerslev, “Generalized autoregressive conditional heteroskedasticity,” Journal of Econometrics 31
1986
Earlier work this paper cites.
Mark W. Krentel, “The complexity of optimization problems,” Journal of Computer and System Sciences 36
1988
Earlier work this paper cites.
Michael R. Garey and David S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness (W. H. Freeman & Co., USA, 1990)
1990
Earlier work this paper cites.
Masuo Suzuki, “Fractal decomposition of exponential operators with applications to many-body theories and Monte Carlo simulations,” Physics Letters A 146
1990
Earlier work this paper cites.
Frank H. Clarke, Optimization and Nonsmooth Analysis (Society for Industrial and Applied Mathematics, 1990) https://epubs.siam.org/doi/pdf/10.1137/1.9781611971309
1990
Earlier work this paper cites.
Brent N. Clark, Charles J. Colbourn, and David S. Johnson, “Unit disk graphs,” Discrete Mathematics 86
1990
Earlier work this paper cites.
Christos H. Papadimitriou and Mihalis Yannakakis, “Optimization, approximation, and complexity classes,” Journal of Computer and System Sciences 43
1991
Earlier work this paper cites.
Masuo Suzuki, “General theory of fractal path integrals with applications to many-body theories and statistical physics,” Journal of Mathematical Physics 32
1991
Earlier work this paper cites.
Michael D. Grigoriadis and Leonid G. Khachiyan, “Approximate solution of matrix games in parallel,” in Advances in Optimization and Parallel Computing , edited by Panos M. Pardalos (Elsevier, 1991)
1991
Earlier work this paper cites.
Raj Jain, The Art of Computer Systems Performance Analysis: Techniques For Experimental Design, Measurement, Simulation, and Modeling (Wiley, 1991)
1991
Earlier work this paper cites.
Avrim L. Blum and Ronald L. Rivest, “Training a 3-node neural network is NP-complete,” Neural Networks 5
1992
Earlier work this paper cites.
Fischer Black and Robert Litterman, “Global portfolio optimization,” Financial Analysts Journal 48
1992
Earlier work this paper cites.
Steven L. Heston, “A Closed-Form Solution for Options with Stochastic Volatility with Applications to Bond and Currency Options,” The Review of Financial Studies 6
1993
Earlier work this paper cites.
P.W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994) pp. 124–134
1994
Earlier work this paper cites.
Carsten Lund and Mihalis Yannakakis, “On the hardness of approximating minimization problems,” Journal of the ACM 41
1994
Earlier work this paper cites.
A.B. Finnila, M.A. Gomez, C. Sebenik, C. Stenson, and J.D. Doll, “Quantum annealing: A new method for minimizing multidimensional functions,” Chemical Physics Letters 219
1994
Earlier work this paper cites.
P.W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994) pp. 124–134
1994
Earlier work this paper cites.
Michael D. Grigoriadis and Leonid G. Khachiyan, “A sublinear-time randomized approximation algorithm for matrix games,” Operations Research Letters 18
1995
Earlier work this paper cites.
John S Baras and A Kurzhanski, “Nonlinear filtering: The set-membership (bounding) and the h ∞ \infty techniques,” IFAC Proceedings Volumes 28
1995
Earlier work this paper cites.
Lov K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing , STOC ’96 (Association for Computing Machinery, New York, NY, USA, 1996) p. 212–219
1996
Earlier work this paper cites.
Lenore Blum, Felipe Cucker, Mike Shub, and Steve Smale, “Complexity and real computation: A manifesto,” International Journal of Bifurcation and Chaos 6
1996
Earlier work this paper cites.
Seth Lloyd, “Universal quantum simulators,” Science 273
1996
Earlier work this paper cites.
William J Cook, William H Cunningham, William R Pulleyblank, and Alexander Schrijver, “Wiley-interscience series in discrete mathematics and optimization,” in Combinatorial Optimization (John Wiley & Sons, Ltd, 1997) pp. 356–356
1997
Earlier work this paper cites.
Ethan Bernstein and Umesh Vazirani, “Quantum complexity theory,” SIAM Journal on Computing 26
1997
Earlier work this paper cites.
Liming Cai and Jianer Chen, “On fixed-parameter tractability and approximability of np optimization problems,” Journal of Computer and System Sciences 54
1997
Earlier work this paper cites.
Martino Bardi, Italo Capuzzo Dolcetta, et al. , Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations , Vol. 12 (Springer, 1997)
1997
Earlier work this paper cites.
Rainer E. Burkard, Stefan E. Karisch, and Franz Rendl, “Qaplib –a quadratic assignment problem library,” Journal of Global Optimization 10
1997
Earlier work this paper cites.
Tadashi Kadowaki and Hidetoshi Nishimori, “Quantum annealing in the transverse Ising model,” Physical Review E 58
1998
Earlier work this paper cites.
David L. Applegate, Robert E. Bixby, Vašek Chvátal, and William J. Cook, “On the solution of traveling salesman problems.” Documenta Mathematica , 645–656 (1998)
1998
Earlier work this paper cites.
Aharon Ben-Tal and Arkadi Nemirovski, “Robust convex optimization,” Mathematics of operations research 23
1998
Earlier work this paper cites.
L. Viola and S. Lloyd, “Dynamical suppression of decoherence in two-state quantum systems,” Phy. Rev. A 58
1998
Earlier work this paper cites.
David L. Applegate, Robert E. Bixby, Vasek Chvátal, and William J. Cook, “Finding Tours in the TSP,” (1999)
1999
Earlier work this paper cites.
R. G. Downey and M. R. Fellows, Parameterized Complexity (Springer New York, 1999)
1999
Earlier work this paper cites.
Christoph Durr and Peter Hoyer, “A quantum algorithm for finding the minimum,” (1999), arXiv:quant-ph/9607014 [quant-ph]
1999
Earlier work this paper cites.
Daniel S. Abrams and Seth Lloyd, “Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors,” Phys. Rev. Lett. 83
1999
Earlier work this paper cites.
Edward Anderson, Zhaojun Bai, Christian Bischof, Susan Blackford, James Demmel, Jack Dongarra, Jeremy Du Croz, Anne Greenbaum, Sven Hammarling, Alan McKenney, et al. , LAPACK Users’ guide (SIAM, 1999)
1999
Earlier work this paper cites.
A. Ambainis, A. Nayak, A. Tashma, and U. Vazirani, “Dense quantum coding and a lower bound for 1-way quantum automata,” in Proceedings of 31st ACM Symposium on Theory of Computing (ACM, 1999) pp. 376–383
1999
Earlier work this paper cites.
D. Vitali and P. Tombesi, “Using parity kicks for decoherence control,” Phy. Rev. A 59
1999
Earlier work this paper cites.
G. Cornuéjols and M. Dawande, “A class of hard small 01 programs,” INFORMS Journal on Computing 11
1999
Earlier work this paper cites.
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser, “Quantum computation by adiabatic evolution,” (2000), arXiv:quant-ph/0001106
2000
Earlier work this paper cites.
Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2000)
2000
Earlier work this paper cites.
Barbara M Terhal and David P DiVincenzo, “Problem of equilibration and the computation of correlation functions on a quantum computer,” Physical Review A 61
2000
Earlier work this paper cites.
Nathan Linial, Alex Samorodnitsky, and Avi Wigderson, “A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents,” Combinatorica 20
2000
Earlier work this paper cites.
Pablo A Parrilo, Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization (California Institute of Technology, 2000)
2000
Earlier work this paper cites.
Christos H Papadimitriou and Mihalis Yannakakis, “On the approximability of trade-offs and optimal access of web sources,” in Proceedings 41st annual symposium on foundations of computer science (IEEE, 2000) pp. 86–92
2000
Earlier work this paper cites.
David P. DiVincenzo, “The physical implementation of quantum computation,” Fortschritte der Physik 48
2000
Earlier work this paper cites.
Holger Hoos and Thomas Stützle, “SATLIB: An online resource for research on SAT,” (Kluwer Academic Publishers, 2000) pp. 283–292
2000
Earlier work this paper cites.
N. J. A. Sloane, “Challenge problems: Independent sets in graphs,” (2000)
2000
Earlier work this paper cites.
J. Muzy, J. Delour, and E. Bacry, “Modelling fluctuations of financial time series: from cascade process to stochastic volatility model,” Eur. Phys. J. B 17 , 537–548 (2000)
2000
Earlier work this paper cites.
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald de Wolf, “Quantum lower bounds by polynomials,” Journal of the ACM (JACM) 48
2001
Earlier work this paper cites.
Johan Håstad, “Some optimal inapproximability results,” Journal of the ACM 48
2001
Earlier work this paper cites.
Jean B. Lasserre, “Global optimization with polynomials and the problem of moments,” SIAM Journal on optimization 11
2001
Earlier work this paper cites.
Francis A. Longstaff and Eduardo S. Schwartz, “Valuing american options by simulation: a simple least-squares approach,” The review of financial studies 14
2001
Earlier work this paper cites.
Rama Cont, “Empirical properties of asset returns: stylized facts and statistical issues,” Quantitative Finance 1
2001
Earlier work this paper cites.
Aharon Ben-Tal and Arkadi Nemirovski, Lectures on Modern Convex Optimization (Society for Industrial and Applied Mathematics, 2001)
2001
Earlier work this paper cites.
Nicholas I. M. Gould, Mary E. Hribar, and Jorge Nocedal, “On the solution of equality constrained quadratic programming problems arising in optimization,” SIAM Journal on Scientific Computing 23
2001
Earlier work this paper cites.
Subhash Khot, “On the power of unique 2-prover 1-round games,” in 34th Annual ACM Symposium on Theory of Computing STOC’02 (2002) pp. 767–775
2002
Earlier work this paper cites.
Dorit Aharonov and Tomer Naveh, “Quantum np - a survey,” (2002), arXiv:quant-ph/0210077 [quant-ph]
2002
Earlier work this paper cites.
Alexei Yu Kitaev, Alexander Shen, and Mikhail N Vyalyi, Classical and quantum computation , Vol. 47 (American Mathematical Soc., 2002)
2002
Earlier work this paper cites.
2002
Earlier work this paper cites.
Gilles Brassard, Peter Hoyer, Michele Mosca, and Alain Tapp, “Quantum amplitude amplification and estimation,” Contemporary Mathematics 305
2002
Earlier work this paper cites.
Aharon Ben-Tal and Arkadi Nemirovski, “Robust optimization–methodology and applications,” Mathematical programming 92
2002
Earlier work this paper cites.
A. Ambainis, A. Nayak, A. Ta-shma, and U. Vazirani, “Dense quantum coding and quantum finite automata,” Journal of the ACM 49
2002
Earlier work this paper cites.
Giuseppe E Santoro, Roman Martoňák, Erio Tosatti, and Roberto Car, “Theory of quantum annealing of an Ising spin glass,” Science 295
2002
Earlier work this paper cites.
D. Bulger, W. P. Baritompa, and G. R. Wood, “Implementing pure adaptive search with grover's quantum algorithm,” Journal of Optimization Theory and Applications 116
2003
Earlier work this paper cites.
Mustafa Demirplak and Stuart A. Rice, “Adiabatic population transfer with control fields,” The Journal of Physical Chemistry A 107
2003
Earlier work this paper cites.
Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, and Daniel A. Spielman, “Exponential algorithmic speedup by a quantum walk,” in Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing , STOC ’03 (Association for Computing Machinery, New York, NY, USA, 2003) p. 59–68
2003
Earlier work this paper cites.
Michal Kočvara and Michael Stingl, “Pennon: A code for convex nonlinear and semidefinite programming,” Optimization methods and software 18
2003
Earlier work this paper cites.
2004
Earlier work this paper cites.
Jun Zhang, Jiri Vala, Shankar Sastry, and K. Birgitta Whaley, “Minimum construction of two-qubit quantum operations,” Phys. Rev. Lett. 93
2004
Earlier work this paper cites.
M. L. Mehta, “Random matrices,” (2004)
2004
Earlier work this paper cites.
N.P. Padhy, “Unit commitment-a bibliographical survey,” IEEE Transactions on Power Systems 19
2004
Earlier work this paper cites.
Chris Marriott and John Watrous, “Quantum arthur–merlin games,” computational complexity 14
2005
Earlier work this paper cites.
W. P. Baritompa, D. W. Bulger, and G. R. Wood, “Grover's quantum algorithm applied to global optimization,” SIAM Journal on Optimization 15
2005
Earlier work this paper cites.
Andrew J Sommese, Charles W Wampler, et al. , The Numerical solution of systems of polynomials arising in engineering and science (World Scientific, 2005)
2005
Earlier work this paper cites.
Alán Aspuru-Guzik, Anthony D. Dutoi, Peter J. Love, and Martin Head-Gordon, “Simulated quantum computation of molecular energies,” Science 309
2005
Earlier work this paper cites.
Sanjeev Arora, Elad Hazan, and Satyen Kale, “Fast algorithms for approximate semidefinite programming using the multiplicative weights update method,” in 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05) (IEEE, 2005) pp. 339–348
2005
Earlier work this paper cites.
Mukul R. Prasad, Armin Biere, and Aarti Gupta, “A survey of recent advances in SAT-based formal verification,” International Journal on Software Tools for Technology Transfer 7
2005
Earlier work this paper cites.
Oded Goldreich, “On promise problems (a survey in memory of shimon even [1935-2004]),” ECCC, TR05-018 127
2005
Earlier work this paper cites.
Andrej Bogdanov, Luca Trevisan, et al. , “Average-case complexity,” Foundations and Trends® in Theoretical Computer Science 2
2006
Earlier work this paper cites.
Martin Dyer and Leen Stougie, “Computational complexity of stochastic programming problems,” Mathematical Programming 106
2006
Earlier work this paper cites.
David L. Applegate, Robert E. Bixby, Vašek Chvatál, and William J. Cook, The Traveling Salesman Problem: A Computational Study (Princeton University Press, 2006)
2006
Earlier work this paper cites.
Jorge Nocedal and Stephen J. Wright, Numerical Optimization , 2nd ed. (Springer, New York, NY, USA, 2006)
2006
Earlier work this paper cites.
J.F. Bonnans, J.C. Gilbert, C. Lemarechal, and C.A. Sagastizábal, Numerical Optimization: Theoretical and Practical Aspects , Universitext (Springer Berlin Heidelberg, 2006)
2006
Earlier work this paper cites.
Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O’Donnell, “Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?” SIAM Journal on Computing 37
2007
Earlier work this paper cites.
Sabine Jansen, Mary-Beth Ruskai, and Ruedi Seiler, “Bounds for the adiabatic approximation with applications to quantum computation,” Journal of Mathematical Physics 48
2007
Earlier work this paper cites.
Dominic W. Berry, Graeme Ahokas, Richard Cleve, and Barry C. Sanders, “Efficient quantum algorithms for simulating sparse hamiltonians,” Communications in Mathematical Physics 270
2007
Earlier work this paper cites.
Florent Krzakała, Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian, and Lenka Zdeborová, “Gibbs states and the set of solutions of random constraint satisfaction problems,” Proceedings of the National Academy of Sciences 104
2007
Earlier work this paper cites.
Giuseppe C. Calafiore and Fabrizio Dabbene, “A probabilistic analytic center cutting plane method for feasibility of uncertain lmis,” Automatica 43
2007
Earlier work this paper cites.
2007
Earlier work this paper cites.
Nicholas Nethercote, Peter J. Stuckey, Ralph Becket, Sebastian Brand, Gregory J. Duck, and Guido Tack, “Minizinc: Towards a standard cp modelling language,” in Principles and Practice of Constraint Programming – CP 2007 , edited by Christian Bessière (Springer Berlin Heidelberg, 2007) pp. 529–543
2007
Earlier work this paper cites.
David Pisinger, “The quadratic knapsack problem—a survey,” Discrete Applied Mathematics 155
2007
Earlier work this paper cites.
Stavros Zenios, Practical Financial Optimization. Decision making for financial engineers (Wiley-Blackwell, 2007)
2007
Earlier work this paper cites.
Rama Cont, “Volatility clustering in financial markets: Empirical facts and agent-based models,” in Long Memory in Economics (Springer Berlin Heidelberg, Berlin, Heidelberg, 2007) pp. 289–309
2007
Earlier work this paper cites.
Arkadi Nemirovski and Alexander Shapiro, “Convex approximations of chance constrained programs,” SIAM Journal on Optimization 17
2007
Earlier work this paper cites.
2008
Earlier work this paper cites.
JD Biamonte, “Nonperturbative k-body to two-body commuting conversion hamiltonians and embedding problem instances into ising spins,” Physical Review A 77
2008
Earlier work this paper cites.
Rolando D Somma, Sergio Boixo, Howard Barnum, and Emanuel Knill, “Quantum simulations of classical annealing processes,” Physical review letters 101
2008
Earlier work this paper cites.
Satoshi Morita and Hidetoshi Nishimori, “Mathematical foundation of quantum annealing,” Journal of Mathematical Physics 49
2008
Earlier work this paper cites.
Grant Schoenebeck, “Linear level lasserre lower bounds for certain k-csps,” in 2008 49th Annual IEEE Symposium on Foundations of Computer Science (IEEE, 2008) pp. 593–602
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
Aharon Ben-Tal and Arkadi Nemirovski, “Selected topics in robust convex optimization,” Mathematical Programming 112
2008
Earlier work this paper cites.
Byron Drury and Peter Love, “Constructive quantum Shannon decomposition from Cartan involutions,” Journal of Physics A: Mathematical and Theoretical 41
2008
Earlier work this paper cites.
Koen Claessen, Niklas Een, Mary Sheeran, and Niklas Sorensson, “Sat-solving in practice,” in 2008 9th International Workshop on Discrete Event Systems (IEEE, 2008) pp. 61–67
2008
Earlier work this paper cites.
Richard O. Michaud and Robert O. Michaud, Efficient Asset Management: A Practical Guide to Stock Portfolio Optimization and Asset Allocation , OUP Catalogue No. 9780195331912 (Oxford University Press, 2008)
2008
Earlier work this paper cites.
Henrik Lund and Willett Kempton, “Integration of renewable energy into the transport and electricity sectors through V2G,” Energy Policy 36
2008
Earlier work this paper cites.
Sanjeev Arora and Boaz Barak, Computational Complexity: A Modern Approach (Cambridge University Press, 2009)
2009
Earlier work this paper cites.
John Watrous, “Quantum Computational Complexity,” in Encyclopedia of Complexity and Systems Science , edited by Robert A. Meyers (Springer New York, New York, NY, 2009) pp. 7174–7201
2009
Earlier work this paper cites.
Sanjeev Arora and Boaz Barak, Computational Complexity (Cambridge University Press, 2009)
2009
Earlier work this paper cites.
Daniel A Spielman and Shang-Hua Teng, “Smoothed analysis: an attempt to explain the behavior of algorithms in practice,” Communications of the ACM 52
2009
Earlier work this paper cites.
Daniel A Lidar, Ali T Rezakhani, and Alioscia Hamma, “Adiabatic approximation with exponential accuracy for many-body systems and quantum computation,” Journal of Mathematical Physics 50
2009
Earlier work this paper cites.
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd, “Quantum algorithm for linear systems of equations,” Phys. Rev. Lett. 103
2009
Earlier work this paper cites.
David Poulin and Pawel Wocjan, “Sampling from the thermal quantum gibbs state and evaluating partition functions with a quantum computer,” Physical review letters 103
2009
Earlier work this paper cites.
Samuel Burer, “On the copositive representation of binary and continuous nonconvex quadratic programs,” Mathematical Programming 120
2009
Earlier work this paper cites.
2009
Earlier work this paper cites.
Jakob Puchinger, Günther R. Raidl, and Ulrich Pferschy, “The Multidimensional Knapsack Problem: Structure and Algorithms,” INFORMS J. on Computing 22
2010
Earlier work this paper cites.
Jianer Chen, Iyad A. Kanj, and Ge Xia, “Improved upper bounds for vertex cover,” Theoretical Computer Science 411
2010
Earlier work this paper cites.
Ilias Diakonikolas and Mihalis Yannakakis, “Small approximate pareto sets for biobjective shortest paths and other problems,” SIAM Journal on Computing 39
2010
Earlier work this paper cites.
Chad Rigetti and Michel Devoret, “Fully microwave-tunable universal gates in superconducting qubits with linear couplings and fixed transition frequencies,” Phys. Rev. B 81
2010
Earlier work this paper cites.
Doron Avramov and Guofu Zhou, “Bayesian portfolio analysis,” Annual Review of Financial Economics 2
2010
Earlier work this paper cites.
William J Cook, David L Applegate, Robert E Bixby, and Vasek Chvatal, The traveling salesman problem: a computational study (Princeton university press, 2011)
2011
Earlier work this paper cites.
Donny Cheung, Peter Høyer, and Nathan Wiebe, “Improved error bounds for the adiabatic approximation,” Journal of Physics A: Mathematical and Theoretical 44
2011
Earlier work this paper cites.
K. Temme, T. J. Osborne, K. G. Vollbrecht, D. Poulin, and F. Verstraete, “Quantum metropolis sampling,” Nature 471
2011
Earlier work this paper cites.
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, and John Watrous, “Qip = pspace,” J. ACM 58
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
Peter JC Dickinson, “Geometry of the copositive and completely positive cones,” Journal of Mathematical Analysis and Applications 380
2011
Earlier work this paper cites.
Wei Chu, Lihong Li, Lev Reyzin, and Robert Schapire, “Contextual bandits with linear payoff functions,” in Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics (JMLR Workshop and Conference Proceedings, 2011) pp. 208–214
2011
Earlier work this paper cites.
Dimitris Bertsimas, David B. Brown, and Constantine Caramanis, “Theory and applications of robust optimization,” SIAM review 53
2011
Earlier work this paper cites.
Matthias Müller, Brian Whitney, Robert Henschel, and Kalyan Kumaran, “Spec benchmarks,” in Encyclopedia of Parallel Computing (Springer US, Boston, MA, 2011) pp. 1886–1893
2011
Earlier work this paper cites.
Olivier Ledoit and Sandrine Péché, “Eigenvectors of some large sample covariance matrix ensembles,” Probability Theory and Related Fields 151
2011
Earlier work this paper cites.
Pierre-Alain Reigneron, Romain Allez, and Jean-Philippe Bouchaud, “Principal regression analysis and the index leverage effect,” Physica A: Statistical Mechanics and its Applications 390
2011
Earlier work this paper cites.
William J Cook, In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation (Princeton university press, 2012)
2012
Earlier work this paper cites.
Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, and Marco Protasi, Complexity and approximation: Combinatorial optimization problems and their approximability properties (Springer Science & Business Media, 2012)
2012
Earlier work this paper cites.
Man-Hong Yung and Alán Aspuru-Guzik, “A quantum–quantum metropolis algorithm,” Proceedings of the National Academy of Sciences 109
2012
Earlier work this paper cites.
Martin Grötschel, László Lovász, and Alexander Schrijver, Geometric algorithms and combinatorial optimization , Vol. 2 (Springer Science & Business Media, 2012)
2012
Earlier work this paper cites.
Immanuel M Bomze, “Copositive optimization–recent developments and applications,” European Journal of Operational Research 216
2012
Earlier work this paper cites.
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, and Junichi Teruyama, “Quantum counterfeit coin problems,” Theoretical Computer Science 456
2012
Earlier work this paper cites.
Immanuel Bloch, Jean Dalibard, and Sylvain Nascimbène, “Quantum simulations with ultracold quantum gases,” Nature Physics 8
2012
Earlier work this paper cites.
S. Trotzky, Y-A. Chen, A. Flesch, I. P. McCulloch, U. Schollwöck, J. Eisert, and I. Bloch, “Probing the relaxation towards equilibrium in an isolated strongly correlated one-dimensional bose gas,” Nature Physics 8
2012
Earlier work this paper cites.
R. Blatt and C. F. Roos, “Quantum simulations with trapped ions,” Nature Physics 8
2012
Earlier work this paper cites.
Edson L. Padoin, Daniel A.G. de Oliveira, Pedro Velho, and Philippe O.A. Navaux, “Time-to-solution and energy-to-solution: A comparison between arm and xeon,” in 2012 Third Workshop on Applications for Multi-Core Architecture (2012)
2012
Earlier work this paper cites.
Victor Bapst, Laura Foini, Florent Krzakala, Guilhem Semerjian, and Francesco Zamponi, “The quantum adiabatic algorithm applied to random optimization problems: The quantum spin glass perspective,” Physics Reports 523
2013
Earlier work this paper cites.
Adolfo del Campo, “Shortcuts to adiabaticity by counterdiabatic driving,” Phys. Rev. Lett. 111
2013
Earlier work this paper cites.
Ryan Babbush, Bryan O’Gorman, and Alán Aspuru-Guzik, “Resource efficient gadgets for compiling adiabatic quantum optimization problems,” Annalen der Physik 525
2013
Earlier work this paper cites.
Timo Berthold, “Measuring the impact of primal heuristics,” Operations Research Letters 41
2013
Earlier work this paper cites.
Maciej Liśkiewicz and Martin R Schuster, “A new upper bound for the traveling salesman problem in cubic graphs,” Journal of Discrete Algorithms 27
2014
Earlier work this paper cites.
Andreas Björklund, Petteri Kaski, and Lukasz Kowalik, “Fast Witness Extraction using a Decision Oracle,” in Algorithms - ESA 2014/Lecture notes in computer science , Vol. 8737, edited by Andreas Schulz and Dorothea Wagner (Springer, 2014) pp. 149–160
2014
Earlier work this paper cites.
Troels F. Rønnow, Zhihui Wang, Joshua Job, Sergio Boixo, Sergei V. Isakov, David Wecker, John M. Martinis, Daniel A. Lidar, and Matthias Troyer, “Defining and detecting quantum speedup,” Science 345
2014
Earlier work this paper cites.
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Alán Aspuru-Guzik, and Jeremy L. O’Brien, “A variational eigenvalue solver on a photonic quantum processor,” Nature Communications 5
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
Andrew Lucas, “Ising formulations of many NP problems,” Frontiers in Physics 2
2014
Earlier work this paper cites.
Dimitri P Bertsekas, Constrained optimization and Lagrange multiplier methods (Academic press, 2014)
2014
Earlier work this paper cites.
Ernesto G Birgin and José Mario Martínez, Practical augmented Lagrangian methods for constrained optimization (SIAM, 2014)
2014
Earlier work this paper cites.
Peter JC Dickinson and Luuk Gijben, “On the computational complexity of membership problems for the completely positive cone and its dual,” Computational optimization and applications 57
2014
Earlier work this paper cites.
Martin L Puterman, Markov decision processes: discrete stochastic dynamic programming (John Wiley & Sons, 2014)
2014
Earlier work this paper cites.
R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, E. Jeffrey, T. C. White, J. Mutus, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, C. Neill, P. O’Malley, P. Roushan, A. Vainsencher, J. Wenner, A. N. Korotkov, A. N. Cleland, and John M. Martinis, “Superconducting quantum circuits at the surface code threshold for fault tolerance,” Nature 508
2014
Earlier work this paper cites.
D. J. Egger and F. K. Wilhelm, “Optimal control of a quantum measurement,” Phys. Rev. A 90
2014
Earlier work this paper cites.
Troels F. Rønnow, Zhihui Wang, Joshua Job, Sergio Boixo, Sergei V. Isakov, David Wecker, John M. Martinis, Daniel A. Lidar, and Matthias Troyer, “Defining and detecting quantum speedup,” Science 345
2014
Cited alongside, same era.
Catherine C. McGeoch, “Adiabatic quantum computation,” in Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice (Springer International Publishing, Cham, 2014) pp. 9–27
2014
Cited alongside, same era.
Sergio Boixo, Troels F Rønnow, Sergei V Isakov, Zhihui Wang, David Wecker, Daniel A Lidar, John M Martinis, and Matthias Troyer, “Evidence for quantum annealing with more than one hundred qubits,” Nat. Phys. 10
2014
Cited alongside, same era.
Petter N. Kolm, Reha Tütüncü, and Frank J. Fabozzi, “60 years of portfolio optimization: Practical challenges and current trends,” European Journal of Operational Research 234
2014
Cited alongside, same era.
2021
Later among the works it cites.
Basel Committee on Banking Supervision, Bank of International Settlements, “Climate-related risk drivers and their transmission channels,” (2021)
2021
Later among the works it cites.
Armine Karami, Raphael Benichou, Michael Benzaquen, and Jean-Philippe Bouchaud, “Conditional correlations and principal regression analysis for futures,” Wilmott 2021
2021
Later among the works it cites.
Samantha Koretsky, Pranav Gokhale, Jonathan M. Baker, Joshua Viszlai, Honghao Zheng, Niroj Gurung, Ryan Burg, Esa Aleksi Paaso, Amin Khodaei, Rozhin Eskandarpour, and Frederic T. Chong, “Adapting quantum approximation optimization algorithm (qaoa) for unit commitment,” in Proceedings of the 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) (2021) pp. 181–187
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Marek Karpinski, Michael Lampis, and Richard Schmied, “New inapproximability bounds for tsp,” Journal of Computer and System Sciences 81
2015
Cited alongside, same era.
T. Chasseur, L. S. Theis, Y. R. Sanders, D. J. Egger, and F. K. Wilhelm, “Engineering adiabaticity at an avoided crossing with optimal control,” Phys. Rev. A 91
2015
Cited alongside, same era.
Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma, “Simulating hamiltonian dynamics with a truncated taylor series,” Phys. Rev. Lett. 114
2015
Cited alongside, same era.
Scott Aaronson, “Read the fine print,” Nature Phys 11
2015
Cited alongside, same era.
Aleksandrs Belovs, “Quantum algorithms for learning symmetric juntas via the adversary bound,” computational complexity 24
2015
Cited alongside, same era.
Aharon Ben-Tal, Elad Hazan, Tomer Koren, and Shie Mannor, “Oracle-based robust optimization via online learning,” Operations Research 63
2015
Cited alongside, same era.
Nery Riquelme, Christian Von Lücken, and Benjamin Baran, “Performance metrics in multi-objective optimization,” in 2015 Latin American Computing Conference (CLEI) (2015) pp. 1–11
2015
Cited alongside, same era.
Richard O. Michaud and Tongshu Ma, “Efficient Asset Management: A Practical Guide to Stock Portfolio Optimization and Asset Allocation.” The Review of Financial Studies 14
2015
Cited alongside, same era.
2021
Later among the works it cites.
Bo Sun, Ali Zeynali, Tongxin Li, Mohammad Hajiesmaili, Adam Wierman, and Danny H.K. Tsang, “Competitive algorithms for the online multiple knapsack problem with application to electric vehicle charging,” Proc. ACM Meas. Anal. Comput. Syst. 4
2021
Later among the works it cites.
Takashi Yamakawa and Mark Zhandry, “Verifiable quantum advantage without structure,” in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2022) pp. 69–74
2022
Later among the works it cites.
2022
Later among the works it cites.
Lars S. Madsen, Fabian Laudenbach, Mohsen Falamarzi. Askarani, Fabien Rortais, Trevor Vincent, Jacob F. F. Bulmer, Filippo M. Miatto, Leonhard Neuhaus, Lukas G. Helt, Matthew J. Collins, Adriana E. Lita, Thomas Gerrits, Sae Woo Nam, Varun D. Vaidya, Matteo Menotti, Ish Dhand, Zachary Vernon, Nicolás Quesada, and Jonathan Lavoie, “Quantum computational advantage with a programmable photonic processor,” Nature 606
2022
Later among the works it cites.
Ran Raz and Avishay Tal, “Oracle separation of bqp and ph,” ACM Journal of the ACM (JACM) 69
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
Kaining Zhang, Liu Liu, Min-Hsiu Hsieh, and Dacheng Tao, “Escaping from the barren plateau via gaussian initializations in deep variational quantum circuits,” Advances in Neural Information Processing Systems 35
2022
Later among the works it cites.
Zoë Holmes, Kunal Sharma, M. Cerezo, and Patrick J. Coles, “Connecting ansatz expressibility to gradient magnitudes and barren plateaus,” PRX Quantum 3
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
Brice Huang and Mark Sellke, “Tight lipschitz hardness for optimizing mean field spin glasses,” in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2022) pp. 312–322
2022
Later among the works it cites.
Joao Basso, David Gamarnik, Song Mei, and Leo Zhou, “Performance and limitations of the qaoa at constant levels on large sparse hypergraphs and spin glass models,” in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2022) pp. 335–343
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
Srinivasan Arunachalam, Vojtech Havlicek, Giacomo Nannicini, Kristan Temme, and Pawel Wocjan, “Simpler (classical) and faster (quantum) algorithms for gibbs partition functions,” Quantum 6
2022
Later among the works it cites.
Fernando GS L Brandao, Richard Kueng, and Daniel Stilck França, “Faster quantum and classical sdp approximations for quadratic binary optimization,” Quantum 6
2022
Later among the works it cites.
Fernando G.S L. Brandã o, Richard Kueng, and Daniel Stilck França, “Faster quantum and classical SDP approximations for quadratic binary optimization,” Quantum 6
2022
Later among the works it cites.
Yves Crama, Sourour Elloumi, Amélie Lambert, and Elisabeth Rodriguez-Heck, “Quadratization and convexification in polynomial binary optimization,” (2022), working paper or preprint
2022
Later among the works it cites.
A.P. Punnen, The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications (Springer International Publishing, 2022)
2022
Later among the works it cites.
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Leo Zhou, “The quantum approximate optimization algorithm and the Sherrington-Kirkpatrick model at infinite size,” Quantum 6
2022
Later among the works it cites.
Joao Basso, Edward Farhi, Kunal Marwaha, Benjamin Villalonga, and Leo Zhou, “The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model,” in 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 232, edited by François Le Gall and Tomoyuki Morimae (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022) pp. 7:1–7:21
2022
Later among the works it cites.
Kunal Marwaha and Stuart Hadfield, “Bounds on approximating max k k xor with quantum and classical local algorithms,” Quantum 6
2022
Later among the works it cites.
2022
Later among the works it cites.
Lucas Slattery, Benjamin Villalonga, and Bryan K. Clark, “Unitary block optimization for variational quantum algorithms,” Physical Review Research 4
2022
Later among the works it cites.
Andreas Bärtschi and Stephan Eidenbenz, “Short-Depth Circuits for Dicke State Preparation,” in IEEE International Conference on Quantum Computing and Engineering QCE’22 (2022) pp. 87–96
2022
Later among the works it cites.
2022
Later among the works it cites.
Simon Apers and Ronald de Wolf, “Quantum speedup for graph sparsification, cut approximation, and Laplacian solving,” SIAM Journal on Computing 51
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
Vladislavs Klevickis, Krisjanis Prusis, and Jevgenijs Vihrovs, “Quantum speedups for treewidth,” in 17th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2022, July 11-15, 2022, Urbana Champaign, Illinois, USA , LIPIcs, Vol. 232, edited by François Le Gall and Tomoyuki Morimae (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022) pp. 11:1–11:18
2022
Later among the works it cites.
Jonathan P Epperlein, Roman Overko, Sergiy Zhuk, Christopher King, Djallel Bouneffouf, Andrew Cullen, and Robert Shorten, “Reinforcement learning with algorithms from probabilistic structure estimation,” Automatica 144
2022
Later among the works it cites.
Arjan Cornelissen, Yassine Hamoudi, and Sofiene Jerbi, “Near-optimal quantum algorithms for multivariate mean estimation,” in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , STOC 2022 (Association for Computing Machinery, New York, NY, USA, 2022) pp. 33–43
2022
Later among the works it cites.
Andrea Skolik, Sofiene Jerbi, and Vedran Dunjko, “Quantum agents in the Gym: a variational quantum algorithm for deep Q-learning,” Quantum 6
2022
Later among the works it cites.
J. F. Doriguello, Alessandro Luongo, Jinge Bao, Patrick Rebentrost, and Miklos Santha, “Quantum Algorithm for Stochastic Optimal Stopping Problems with Applications in Finance,” in 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 232, edited by François Le Gall and Tomoyuki Morimae (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022) pp. 2:1–2:24
2022
Later among the works it cites.
Clemens Dlaska, Kilian Ender, Glen Bigan Mbeng, Andreas Kruckenhauser, Wolfgang Lechner, and Rick van Bijnen, “Quantum optimization via four-body rydberg gates,” Phys. Rev. Lett. 128
2022
Later among the works it cites.
S. Ebadi, A. Keesling, M. Cain, T. T. Wang, H. Levine, D. Bluvstein, G. Semeghini, A. Omran, J.-G. Liu, R. Samajdar, X.-Z. Luo, B. Nash, X. Gao, B. Barak, E. Farhi, S. Sachdev, N. Gemelke, L. Zhou, S. Choi, H. Pichler, S.-T. Wang, M. Greiner, V. Vuletić, and M. D. Lukin, “Quantum optimization of maximum independent set using Rydberg atom arrays,” Science 376
2022
Later among the works it cites.
S. Hadfield, T. Hogg, and E. G. Rieffel, “Analytical framework for quantum alternating operator ansätze,” Quantum Science and Technology 8
2022
Later among the works it cites.
P. Niroula, R. Shaydulin, R. Yalovetsky, P. Minssen, D. Herman, S. Hu, and M. Pistoia, “Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer,” Scientific Reports 12
2022
Later among the works it cites.
P. Chandarana, N. N. Hegade, K. Paul, F. Albarrán-Arriagada, E. Solano, A. del Campo, and Xi Chen, “Digitized-counterdiabatic quantum approximate optimization algorithm,” Phys. Rev. Res. 4
2022
Later among the works it cites.
2022
Later among the works it cites.
Yunlong Yu, Chenfeng Cao, Carter Dewey, Xiang-Bin Wang, Nic Shannon, and Robert Joynt, “Quantum approximate optimization algorithm with adaptive bias fields,” Phys. Rev. Res. 4
2022
Later among the works it cites.
Johannes Weidenfeller, Lucia C Valor, Julien Gacon, Caroline Tornow, Luciano Bello, Stefan Woerner, and Daniel J Egger, “Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware,” Quantum 6
2022
Later among the works it cites.
Laurin E. Fischer, Daniel Miller, Francesco Tacchino, Panagiotis Kl. Barkoutsos, Daniel J. Egger, and Ivano Tavernelli, “Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space,” Phys. Rev. Res. 4
2022
Later among the works it cites.
Andrew Cross, Ali Javadi-Abhari, Thomas Alexander, Niel De Beaudrap, Lev S Bishop, Steven Heidel, Colm A Ryan, Prasahnt Sivarajah, John Smolin, Jay M Gambetta, et al. , “Openqasm 3: A broader and deeper quantum assembly language,” ACM Transactions on Quantum Computing 3
2022
Later among the works it cites.
2022
Later among the works it cites.
Gushu Li, Anbang Wu, Yunong Shi, Ali Javadi-Abhari, Yufei Ding, and Yuan Xie, “Paulihedral: A generalized block-wise compiler optimization framework for quantum simulation kernels,” in Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems , ASPLOS ’22 (Association for Computing Machinery, New York, NY, USA, 2022) pp. 554–569
2022
Later among the works it cites.
Liam Madden and Andrea Simonetto, “Best Approximate Quantum Compiling Problems,” ACM Transactions on Quantum Computing 3
2022
Later among the works it cites.
Lingling Lao and Dan E. Browne, “2qan: A quantum compiler for 2-local qubit hamiltonian simulation algorithms,” in Proceedings of the 49th Annual International Symposium on Computer Architecture , ISCA ’22 (Association for Computing Machinery, New York, NY, USA, 2022) pp. 351–365
2022
Later among the works it cites.
2022
Later among the works it cites.
Christophe Piveteau, David Sutter, and Stefan Woerner, “Quasiprobability decompositions with reduced sampling overhead,” npj Quantum Information 8
2022
Later among the works it cites.
Thorsten Koch, Timo Berthold, Jaap Pedersen, and Charlie Vanaret, “Progress in mathematical programming solvers from 2001 to 2020,” EURO Journal on Computational Optimization 10
2022
Later among the works it cites.
T. Tomesh, P. Gokhale, V. Omole, G. Ravi, K. N. Smith, J. Viszlai, X. Wu, N. Hardavellas, M. R. Martonosi, and F. T. Chong, “SupermarQ: A Scalable Quantum Benchmark Suite,” in 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA) (IEEE Computer Society, Los Alamitos, CA, USA, 2022) pp. 587–603
2022
Later among the works it cites.
2022
Later among the works it cites.
Naeimeh Mohseni, Peter L McMahon, and Tim Byrnes, “Ising machines as hardware solvers of combinatorial optimization problems,” Nature Reviews Physics 4
2022
Later among the works it cites.
Jernej Rudi Finžgar, Philipp Ross, Leonhard Hölscher, Johannes Klepsch, and Andre Luckow, “Quark: A framework for quantum computing application benchmarking,” in 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (2022) pp. 226–237
2022
Later among the works it cites.
D. Hangleiter, J. Carolan, and K.P.Y. Thébault, Analogue Quantum Simulation: A New Instrument for Scientific Understanding (Springer International Publishing, 2022)
2022
Later among the works it cites.
Andrew D. King, Sei Suzuki, Jack Raymond, Alex Zucca, Trevor Lanting, Fabio Altomare, Andrew J. Berkley, Sara Ejtemaee, Emile Hoskinson, Shuiyuan Huang, Eric Ladizinsky, Allison J. R. MacDonald, Gaelen Marsden, Travis Oh, Gabriel Poulin-Lamarre, Mauricio Reis, Chris Rich, Yuki Sato, Jed D. Whittaker, Jason Yao, Richard Harris, Daniel A. Lidar, Hidetoshi Nishimori, and Mohammad H. Amin, “Coherent quantum annealing in a programmable 2,000 qubit Ising chain,” Nature Physics 18
2022
Later among the works it cites.
Jon Nelson, Marc Vuffray, Andrey Y. Lokhov, Tameem Albash, and Carleton Coffrin, “High-Quality Thermal Gibbs Sampling with Quantum Annealing Hardware,” Physical Review Applied 17
2022
Later among the works it cites.
John Golden, Andreas Bärtschi, Daniel O’Malley, and Stephan Eidenbenz, “Fair Sampling Error Analysis on NISQ Devices,” ACM Transactions on Quantum Computing 3
2022
Later among the works it cites.
Abraham P. Punnen, ed., The Quadratic Unconstrained Binary Optimization Problem (Springer, 2022)
2022
Later among the works it cites.
David Amaro, Matthias Rosenkranz, Nathan Fitzpatrick, Koji Hirano, and Mattia Fiorentini, “A case study of variational quantum algorithms for a job shop scheduling problem,” EPJ Quantum Technology 9
2022
Later among the works it cites.
Yifan Zhou, Zefan Tang, Nima Nikmehr, Pouya Babahajiani, Fei Feng, Tzu-Chieh Wei, Honghao Zheng, and Peng Zhang, “Quantum computing in power systems,” iEnergy 1
2022
Later among the works it cites.
Hari P. Paudel, Madhava Syamlal, Scott E. Crawford, Yueh-Lin Lee, Roman A. Shugayev, Ping Lu, Paul R. Ohodnicki, Darren Mollot, and Yuhua Duan, “Quantum computing and simulations for energy applications: Review and perspective,” ACS Engineering 2
2022
Later among the works it cites.
Jayakrishnan Nair, Adam Wierman, and Bert Zwart, The Fundamentals of Heavy Tails: Properties, Emergence, and Estimation , Cambridge Series in Statistical and Probabilistic Mathematics (Cambridge University Press, 2022)
2022
Later among the works it cites.
Sebastian Brandhofer, Daniel Braun, Vanessa Dehn, Gerhard Hellstern, Matthias Hüls, Yanjun Ji, Ilia Polian, Amandeep Singh Bhatia, and Thomas Wellens, “Benchmarking the performance of portfolio optimization with QAOA,” Quantum Information Processing 22
2022
Later among the works it cites.
Samuel Mugel, Carlos Kuchkovsky, Escolástico Sánchez, Samuel Fernández-Lorenzo, Jorge Luis-Hita, Enrique Lizaso, and Román Orús, “Dynamic portfolio optimization with real datasets using quantum processors and quantum-inspired tensor networks,” Physical Review Research 4
2022
Later among the works it cites.
Pascal Halffmann, Patrick Holzer, Kai Plociennik, and Michael Trebing, “A quantum computing approach for the unit commitment problem,” in International Conference on Operations Research , edited by O. Grothe, S. Nickel, S. Rebennack, and O. Stein (Springer, 2022) pp. 113–120
2022
Later among the works it cites.
Reza Mahroo and Amin Kargarian, “Hybrid quantum-classical unit commitment,” in 2022 IEEE Texas Power and Energy Conference (TPEC) (IEEE, 2022)
2022
Later among the works it cites.
Bo Sun, Lin Yang, Mohammad Hajiesmaili, Adam Wierman, John C. S. Lui, Don Towsley, and Danny H.K. Tsang, “The online knapsack problem with departures,” Proc. ACM Meas. Anal. Comput. Syst. 6
2022
Later among the works it cites.
Marika Federer, Daniel Müssig, Stefan Klaiber, Jörg Lässig, Peter Bretschneider, and Steve Lenk, “Application benchmark for quantum optimization on electromobility use case,” in 2022 IEEE Vehicle Power and Propulsion Conference (VPPC) (2022) pp. 1–6
2022
Later among the works it cites.
“3D Star TSPs,” (2023), accessed Dec 3, 2023
2023
Closest in time.
Ewout van den Berg, Zlatko K. Minev, Abhinav Kandala, and Kristan Temme, “Probabilistic error cancellation with sparse pauli–lindblad models on noisy quantum processors,” Nature Physics 19
2023
Closest in time.
Youngseok Kim, Andrew Eddins, Sajant Anand, Ken Xuan Wei, Ewout van den Berg, Sami Rosenblatt, Hasan Nayfeh, Yantao Wu, Michael Zaletel, Kristan Temme, and Abhinav Kandala, “Evidence for the utility of quantum computing before fault tolerance,” Nature 618
2023
Closest in time.
Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, and Hendrik Waldner, “Quantum depth in the random oracle model,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing (2023) pp. 1111–1124
2023
Closest in time.
Sevag Gharibian, “The 7 faces of quantum NP,” (2023), arXiv:2310.18010 [quant-ph]
2023
Closest in time.
Anurag Anshu, Nikolas P. Breuckmann, and Chinmay Nirkhe, “Nlts hamiltonians from good quantum codes,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing , STOC 2023 (Association for Computing Machinery, New York, NY, USA, 2023) p. 1090–1096
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
David Layden, Guglielmo Mazzola, Ryan V Mishmash, Mario Motta, Pawel Wocjan, Jin-Sung Kim, and Sarah Sheldon, “Quantum-enhanced Markov chain Monte Carlo,” Nature 619
2023
Closest in time.
2023
Closest in time.
Chris Cade, Marten Folkertsma, Ido Niesen, and Jordi Weggemans, “Quantifying grover speed-ups beyond asymptotic analysis,” Quantum 7
2023
Closest in time.
2023
Closest in time.
Naeimeh Mohseni, Carlos Navarrete-Benlloch, Tim Byrnes, and Florian Marquardt, “Deep recurrent networks predicting the gap evolution in adiabatic quantum computing,” Quantum 7
2023
Closest in time.
Kyungtaek Jun and Hyunju Lee, “HUBO and QUBO models for prime factorization,” Scientific Reports 13
2023
Closest in time.
2023
Closest in time.
William Kirby, Mario Motta, and Antonio Mezzacapo, “Exact and efficient lanczos method on a quantum computer,” Quantum 7
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Arjan Cornelissen and Yassine Hamoudi, “A sublinear-time quantum algorithm for approximating partition functions,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (SIAM, 2023) pp. 1245–1264
2023
Closest in time.
Adam Bouland, Yosheb M Getachew, Yujia Jin, Aaron Sidford, and Kevin Tian, “Quantum speedups for zero-sum games via improved dynamic gibbs sampling,” in International Conference on Machine Learning (PMLR, 2023) pp. 2932–2952
2023
Closest in time.
2023
Closest in time.
Taylor L. Patti, Jean Kossaifi, Anima Anandkumar, and Susanne F. Yelin, “Quantum goemans-williamson algorithm with the hadamard test and approximate amplitude constraints,” Quantum 7
2023
Closest in time.
John Golden, Andreas Bärtschi, Stephan Eidenbenz, and Daniel O’Malley, “Numerical Evidence for Exponential Speed-up of QAOA over Unstructured Search for Approximate Constrained Optimization,” in IEEE International Conference on Quantum Computing and Engineering QCE’23 (2023) pp. 496–505
2023
Closest in time.
Sammy Khalife, Hongyu Cheng, and Amitabh Basu, “Neural networks with linear threshold activations: structure and algorithms,” Mathematical Programming (2023), 10.1007/s10107-023-02016-5
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
R. Tate, M. Farhadi, C. Herold, G. Mohler, and S. Gupta, “Bridging classical and quantum with SDP initialized warm-starts for QAOA,” ACM Transactions on Quantum Computing 4
2023
Closest in time.
2023
Closest in time.
Nicolas PD Sawaya, Albert T Schmitz, and Stuart Hadfield, “Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems,” Quantum 7
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Maxime Dupont, Bram Evert, Mark J. Hodson, Bhuvanesh Sundar, Stephen Jeffrey, Yuki Yamaguchi, Dennis Feng, Filip B. Maciejewski, Stuart Hadfield, M. Sohaib Alam, Zhihui Wang, Shon Grabbe, P. Aaron Lott, Eleanor G. Rieffel, Davide Venturelli, and Matthew J. Reagor, “Quantum-enhanced greedy combinatorial optimization solver,” Science Advances 9
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Aditi Misra-Spieldenner, Tim Bode, Peter K. Schuhmacher, Tobias Stollenwerk, Dmitry Bagrets, and Frank K. Wilhelm, “Mean-field approximate optimization algorithm,” PRX Quantum 4
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Zeguan Wu, Mohammadhossein Mohammadisiahroudi, Brandon Augustino, Xiu Yang, and Tamás Terlaky, “An inexact feasible quantum interior point method for linearly constrained quadratic optimization,” Entropy 25
2023
Closest in time.
Joran van Apeldoorn, Arjan Cornelissen, András Gilyén, and Giacomo Nannicini, “Quantum tomography using state-preparation unitaries,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (SIAM, 2023) pp. 1265–1318
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Chenyi Zhang and Tongyang Li, “Quantum lower bounds for finding stationary points of nonconvex functions,” in International Conference on Machine Learning (PMLR, 2023) pp. 41268–41299
2023
Closest in time.
2023
Closest in time.
Yizhou Liu, Weijie J Su, and Tongyang Li, “On quantum speedups for nonconvex optimization via quantum tunneling walks,” Quantum 7
2023
Closest in time.
Alexander M Dalzell, Nicola Pancotti, Earl T Campbell, and Fernando GSL Brandão, “Mind the gap: Achieving a super-grover quantum speedup by jumping to the end,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing (2023) pp. 1131–1144
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, and Jevgenijs Vihrovs, “Quantum bounds for 2d-grid and dyck language,” Quantum Inf. Process. 22
2023
Closest in time.
Sofiene Jerbi, Arjan Cornelissen, Maris Ozols, and Vedran Dunjko, “Quantum Policy Gradient Algorithms,” in 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 266, edited by Omar Fawzi and Michael Walter (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2023) pp. 13:1–13:24
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Phillip C. Lotshaw, Kevin D. Battles, Bryan Gard, Gilles Buchs, Travis S. Humble, and Creston D. Herold, “Modeling noise in global mølmer-sørensen interactions applied to quantum approximate optimization,” Physical Review A 107
2023
Closest in time.
Elijah Pelofske, Andreas Bärtschi, John Golden, and Stephan Eidenbenz, “High-Round QAOA for MAX k-SAT on Trapped Ion NISQ Devices,” in IEEE International Conference on Quantum Computing and Engineering QCE’23 (2023) pp. 506–517
2023
Closest in time.
IBM, “IBM Quantum Platform - Compute resources,” (2023)
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Paul D. Nation and Matthew Treinish, “Suppressing quantum circuit errors due to system variability,” PRX Quantum 4
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
A. Matsuo, S. Yamashita, and D. J. Egger, “A SAT approach to the initial mapping problem in SWAP gate insertion for commuting gates,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences , 2022EAP1159 (2023)
2023
Closest in time.
Ethan Smith, Marc Grau Davis, Jeffrey Larson, Ed Younis, Lindsay Bassman Oftelie, Wim Lavrijsen, and Costin Iancu, “LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach,” ACM Transactions on Quantum Computing 4
2023
Closest in time.
2023
Closest in time.
Anette Messinger, Michael Fellner, and Wolfgang Lechner, “Constant Depth Code Deformations in the Parity Architecture,” in IEEE International Conference on Quantum Computing and Engineering QCE’23 (2023) pp. 120–130
2023
Closest in time.
Almudena Carrera Vazquez, Daniel J. Egger, David Ochsner, and Stefan Woerner, “Well-conditioned multi-product formulas for hardware-friendly hamiltonian simulation,” Quantum 7
2023
Closest in time.
Laurin E. Fischer, Alessandro Chiesa, Francesco Tacchino, Daniel J. Egger, Stefano Carretta, and Ivano Tavernelli, “Universal qudit gate synthesis for transmons,” PRX Quantum 4
2023
Closest in time.
Daniel J. Egger, Chiara Capecci, Bibek Pokharel, Panagiotis Kl. Barkoutsos, Laurin E. Fischer, Leonardo Guidoni, and Ivano Tavernelli, “Pulse variational quantum eigensolver on cross-resonance-based hardware,” Phys. Rev. Res. 5
2023
Closest in time.
2023
Closest in time.
“Best practices in quantum optimization,” (2023)
2023
Closest in time.
“DIMACS Implementation Challenges,” (2023)
2023
Closest in time.
Hans Mittelmann, “Decision Tree for Optimization Software,” (2023)
2023
Closest in time.
Gurobi Optimization, GUROBI Optimizer reference manual version 10.0 , Tech. Rep. (Gurobi Optimization, LLC, 2023)
2023
Closest in time.
Yunlong Yu, Chenfeng Cao, Xiang-Bin Wang, Nic Shannon, and Robert Joynt, “Solution of sat problems with the adaptive-bias quantum approximate optimization algorithm,” Physical Review Research 5
2023
Closest in time.
Daniel Rehfeldt, Thorsten Koch, and Yuji Shinano, “Faster exact solution of sparse maxcut and qubo problems,” Mathematical Programming Computation 15
2023
Closest in time.
Juntao Wang, Daniel Ebler, K. Y. Michael Wong, David Shui Wing Hui, and Jie Sun, “Bifurcation behaviors shape how continuous physical dynamics solves discrete ising optimization,” Nature Communications 14
2023
Closest in time.
Andrew D. King, Jack Raymond, Trevor Lanting, Richard Harris, Alex Zucca, Fabio Altomare, Andrew J. Berkley, Kelly Boothby, Sara Ejtemaee, Colin Enderud, Emile Hoskinson, Shuiyuan Huang, Eric Ladizinsky, Allison J. R. MacDonald, Gaelen Marsden, Reza Molavi, Travis Oh, Gabriel Poulin-Lamarre, Mauricio Reis, Chris Rich, Yuki Sato, Nicholas Tsai, Mark Volkmann, Jed D. Whittaker, Jason Yao, Anders W. Sandvik, and Mohammad H. Amin, “Quantum critical dynamics in a 5,000-qubit programmable spin glass,” Nature 617
2023
Closest in time.
“Hexaly,” (2023), localSolver
2023
Closest in time.
Ryo Kuroiwa and J. Christopher Beck, “Solving domain-independent dynamic programming problems with anytime heuristic search,” Proceedings of the International Conference on Automated Planning and Scheduling 33
2023
Closest in time.
Ruben S. Andrist, Martin J. A. Schuetz, Pierre Minssen, Romina Yalovetzky, Shouvanik Chakrabarti, Dylan Herman, Niraj Kumar, Grant Salton, Ruslan Shaydulin, Yue Sun, Marco Pistoia, and Helmut G. Katzgraber, “Hardness of the maximum-independent-set problem on unit-disk graphs and prospects for quantum speedups,” Physical Review Research 5
2023
Closest in time.
Minh-Thi Nguyen, Jin-Guo Liu, Jonathan Wurtz, Mikhail D. Lukin, Sheng-Tao Wang, and Hannes Pichler, “Quantum optimization with arbitrary connectivity using Rydberg atom arrays,” PRX Quantum 4
2023
Closest in time.
David Van Bulck and Dries Goossens, “The international timetabling competition on sports timetabling (itc2021),” European Journal of Operational Research 308
2023
Closest in time.
2023
Closest in time.
Francesco Slongo, Philipp Hauke, Pietro Faccioli, and Cristian Micheletti, “Quantum-inspired encoding enhances stochastic sampling of soft matter systems,” Science Advances 9
2023
Closest in time.
Ruslan Shaydulin and Marco Pistoia, “QAOA with N ⋅ p ≥ 200 N\cdot p\geq 200 ,” in IEEE International Conference on Quantum Computing and Engineering QCE’23 (2023) pp. 1074–1077
2023
Closest in time.
Qiskit contributors, “Qiskit: An Open-source Framework for Quantum Computing,” (2023)
2023
Closest in time.
Shanker Ramamurthy, John J Duigenan, Hans Tesselaar, Hector Arias, and Paolo Sironi, “Embedded finance: Creating the everywhere, everyday bank,” (2023)
2023
Closest in time.
European Central Bank, “Financial stability review,” (2023)
2023
Closest in time.
International Monetary Fund, “Global financial stability report: Financial and climate policies for a high-interest-rate era,” (2023)
2023
Closest in time.
Tom Donilon, Catherine Kress, and Stephanie Lee Jackson Spivey, “Geopolitical risk dashboard,” (2023)
2023
Closest in time.
Organisation for Economic Co-operation and Development, “Environmental social and governance (esg) investing,” (2023)
2023
Closest in time.
Megan C. Giron, Georgios Korpas, Waqas Parvaiz, Prashant Malik, and Johannes Aspman, “Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing,” IEEE Transactions on Quantum Engineering 4
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Giuseppe Colucci, Stan van der Linde, and Frank Phillipson, “Power network optimization: A quantum approach,” IEEE Access 11
2023
Closest in time.
Thomas Morstyn, “Annealing-based quantum computing for combinatorial optimal power flow,” IEEE Transactions on Smart Grid 14
2023
Closest in time.
Philipp Schworm, Xiangqian Wu, Marcel Wagner, Svenja Ehmsen, Moritz Glatt, and Jan C. Aurich, “Energy supply scheduling in manufacturing systems using quantum annealing,” Manufacturing Letters 38
2023
Closest in time.
Financial Times, “France sets course for a nuclear renaissance,” (2023)
2023
Closest in time.
INTERNATIONAL ENERGY AGENCY, “Global EV Outlook 2023,” (2023)
2023
Closest in time.
Renewable Energy World, “Aggreko delivers 2 MW/3.8 MWh energy storage system for National Grid US,” (2023)
2023
Closest in time.
2024
Closest in time.
2024
Closest in time.
Yash J Patel, Sofiene Jerbi, Thomas Bäck, and Vedran Dunjko, “Reinforcement learning assisted recursive qaoa,” EPJ Quantum Technology 11
2024
Closest in time.
2024
Closest in time.
Maxime Dupont and Bhuvanesh Sundar, “Extending relax-and-round combinatorial optimization solvers with quantum correlations,” Physical Review A 109
2024
Closest in time.
Elijah Pelofske, Andreas Bärtschi, and Stephan Eidenbenz, “Short-depth QAOA circuits and quantum annealing on higher-order ising models,” npj Quantum Information 10
2024
Closest in time.
2024
Closest in time.