Fetching the paper…
Reading the bibliography…
Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers due to the extremely high computational cost.
1904
Earlier work this paper cites.
1907
Earlier work this paper cites.
1909
Earlier work this paper cites.
1910
Earlier work this paper cites.
1910
Earlier work this paper cites.
1910
Earlier work this paper cites.
1911
Earlier work this paper cites.
AD McLachlan, “A variational solution of the time-dependent schrodinger equation,” Molecular Physics 8
1964
Earlier work this paper cites.
Walter Kohn and Lu Jeu Sham, “Self-consistent equations including exchange and correlation effects,” Physical review 140
1965
Earlier work this paper cites.
John C Tully and Richard K Preston, “Trajectory surface hopping approach to nonadiabatic molecular collisions: the reaction of h+ with d2,” The Journal of Chemical Physics 55
1971
Earlier work this paper cites.
Francisco Barahona, Martin Grötschel, Michael Jünger, and Gerhard Reinelt, “An application of combinatorial optimization to statistical physics and circuit layout design,” Operations Research 36
1988
Earlier work this paper cites.
James C Spall, “Multivariate stochastic approximation using a simultaneous perturbation gradient approximation,” IEEE transactions on automatic control 37
1992
Earlier work this paper cites.
Steven R White, “Density matrix formulation for quantum renormalization groups,” Physical Review Letters 69
1992
Earlier work this paper cites.
Peter W Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings 35th annual symposium on foundations of computer science (Ieee, 1994) pp. 124–134
1994
Earlier work this paper cites.
Seth Lloyd, “Universal quantum simulators,” Science 273
1996
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.
Markus Gross, David C Müller, Heinz-Georg Nothofer, Ulrich Scherf, Dieter Neher, Christoph Bräuchle, and Klaus Meerholz, “Improving the performance of doped π \pi -conjugated polymers for use in organic light-emitting diodes,” Nature 405
2000
Earlier work this paper cites.
Wolfgang Küchlin and Carsten Sinz, “Proving consistency assertions for automotive product data management,” Journal of Automated Reasoning 24
2000
Earlier work this paper cites.
Harry Buhrman, Richard Cleve, John Watrous, and Ronald De Wolf, “Quantum fingerprinting,” Physical Review Letters 87
2001
Earlier work this paper cites.
MV Altaisky, “Quantum neural network,” arXiv preprint quant-ph/0107012 (2001)
2001
Earlier work this paper cites.
Sergey B Bravyi and Alexei Yu Kitaev, “Fermionic quantum computation,” Annals of Physics 298
2002
Earlier work this paper cites.
Leslie G. Valiant, “Quantum circuits that can be simulated classically in polynomial time,” SIAM Journal on Computing 31
2002
Earlier work this paper cites.
Barbara M. Terhal and David P. DiVincenzo, “Classical simulation of noninteracting-fermion quantum circuits,” Phys. Rev. A 65
2002
Earlier work this paper cites.
Robert B Griffiths, Consistent quantum theory (Cambridge University Press, 2003)
2003
Earlier work this paper cites.
2004
Earlier work this paper cites.
2004
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.
B. Rosgen and J. Watrous, “On the hardness of distinguishing mixed-state quantum computations,” in 20th Annual IEEE Conference on Computational Complexity (CCC’05) (2005) pp. 344–354
2005
Earlier work this paper cites.
2005
Earlier work this paper cites.
Andrew G. Taube and Rodney J. Bartlett, “New perspectives on unitary coupled-cluster theory,” International Journal of Quantum Chemistry 106
2006
Earlier work this paper cites.
2006
Earlier work this paper cites.
Patrick Hayden and John Preskill, “Black holes as mirrors: quantum information in random subsystems,” Journal of high energy physics 2007
2007
Earlier work this paper cites.
2007
Earlier work this paper cites.
2007
Earlier work this paper cites.
2007
Earlier work this paper cites.
Richard Jozsa and Akimasa Miyake, “Matchgates and classical simulation of quantum circuits,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 464
2008
Earlier work this paper cites.
Igor L. Markov and Yaoyun Shi, “Simulating quantum computation by contracting tensor networks,” SIAM Journal on Computing 38
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
JR Schmidt, Priya V Parandekar, and John C Tully, “Mixed quantum-classical equilibrium: Surface hopping,” The Journal of Chemical Physics 129
2008
Earlier work this paper cites.
Aram W Harrow, Avinatan Hassidim, and Seth Lloyd, “Quantum algorithm for linear systems of equations,” Physical Review Letters 103
2009
Earlier work this paper cites.
Wojciech Hubert Zurek, “Quantum darwinism,” Nature physics 5
2009
Earlier work this paper cites.
Aram W Harrow and Richard A Low, “Random quantum circuits are approximate 2-designs,” Communications in Mathematical Physics 291
2009
Earlier work this paper cites.
2010
Earlier work this paper cites.
2010
Earlier work this paper cites.
2010
Earlier work this paper cites.
Kishor Bharti and Tobias Haug, “Quantum assisted simulator,” arXiv preprint arXiv:2011.06911 (2020b)
2011
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition , 10th ed. (Cambridge University Press, New York, NY, USA, 2011)
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
Garnet Kin-Lic Chan and Sandeep Sharma, “The density matrix renormalization group in quantum chemistry,” Annual Review of Physical Chemistry 62
2011
Earlier work this paper cites.
A Ambainis, “Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations 29th int,” in Symp. Theoretical Aspects of Computer Science (STACS 2012) , Vol. 14 (2012) pp. 636–47
2012
Earlier work this paper cites.
David R Weinberg, Christopher J Gagliardi, Jonathan F Hull, Christine Fecenko Murphy, Caleb A Kent, Brittany C Westlake, Amit Paul, Daniel H Ess, Dewey Granville McCafferty, and Thomas J Meyer, “Proton-coupled electron transfer,” Chemical Reviews 112
2012
Earlier work this paper cites.
Mark M Wilde, Quantum information theory (Cambridge University Press, 2013)
2013
Earlier work this paper cites.
Artem A Bakulin, Stoichko D Dimitrov, Akshay Rao, Philip CY Chow, Christian B Nielsen, Bob C Schroeder, Iain McCulloch, Huib J Bakker, James R Durrant, and Richard H Friend, “Charge-transfer state dynamics following hole and electron transfer in organic photovoltaic devices,” The Journal of Physical Chemistry Letters 4
2013
Earlier work this paper cites.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. 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.
Seth Lloyd, Masoud Mohseni, and Patrick Rebentrost, “Quantum principal component analysis,” Nature Physics 10
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
Dave Wecker, Matthew B Hastings, and Matthias Troyer, “Progress towards practical quantum variational algorithms,” Physical Review A 92
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
Maria Schuld, Ilya Sinayskiy, and Francesco Petruccione, “An introduction to quantum machine learning,” Contemporary Physics 56
2015
Earlier work this paper cites.
“IBM Makes Quantum Computing Available on IBM Cloud to Accelerate Innovation,” (2016), press release at https://www-03.ibm.com/press/us/en/pressrelease/49661.wss
2016
Earlier work this paper cites.
Peter JJ O’Malley, Ryan Babbush, Ian D Kivlichan, Jonathan Romero, Jarrod R McClean, Rami Barends, Julian Kelly, Pedram Roushan, Andrew Tranter, Nan Ding, et al. , “Scalable quantum simulation of molecular energies,” Physical Review X 6
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
Dave Wecker, Matthew B Hastings, and Matthias Troyer, “Training a quantum optimizer,” Physical Review A 94
2016
Earlier work this paper cites.
Edwin Stoudenmire and David J Schwab, “Supervised learning with tensor networks,” in Advances in Neural Information Processing Systems (2016) pp. 4799–4807
2016
Earlier work this paper cites.
Fernando GSL Brandao, Aram W Harrow, and Michał Horodecki, “Local random quantum circuits are approximate polynomial-designs,” Communications in Mathematical Physics 346
2016
Earlier work this paper cites.
Jarrod R McClean, Jonathan Romero, Ryan Babbush, and Alán Aspuru-Guzik, “The theory of variational hybrid quantum-classical algorithms,” New Journal of Physics 18
2016
Earlier work this paper cites.
Bela Bauer, Dave Wecker, Andrew J Millis, Matthew B Hastings, and Matthias Troyer, “Hybrid quantum-classical approach to correlated materials,” Physical Review X 6
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, “Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets,” Nature 549
2017
Earlier work this paper cites.
Zhi-Cheng Yang, Armin Rahmani, Alireza Shabani, Hartmut Neven, and Claudio Chamon, “Optimizing variational quantum algorithms using pontryagin’s minimum principle,” Phys. Rev. X 7
2017
Earlier work this paper cites.
Jun Li, Xiaodong Yang, Xinhua Peng, and Chang-Pu Sun, “Hybrid quantum-classical approach to quantum optimal control,” Phys. Rev. Lett. 118
2017
Earlier work this paper cites.
Dawei Lu, Keren Li, Jun Li, Hemant Katiyar, Annie Jihyun Park, Guanru Feng, Tao Xin, Hang Li, Guilu Long, Aharon Brodutch, Jonathan Baugh, Bei Zeng, and Raymond Laflamme, “Enhancing quantum control by bootstrapping a quantum processor of 12 qubits,” npj Quantum Information 3
2017
Earlier work this paper cites.
Jarrod R McClean, Mollie E Kimchi-Schwartz, Jonathan Carter, and Wibe A de Jong, “Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states,” Physical Review A 95
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
Ying Li and Simon C Benjamin, “Efficient variational quantum simulator incorporating active error minimization,” Physical Review X 7
2017
Earlier work this paper cites.
A. Childs, R. Kothari, and R. Somma, “Quantum algorithm for systems of linear equations with exponentially improved dependence on precision,” SIAM J. Computing 46
2017
Earlier work this paper cites.
A. Scherer, B. Valiron, S.-C. Mau, S. Alexander, E. Van den Berg, and T. E. Chapuran, “Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target,” Quantum Information Processing 16
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
Jacob Biamonte, Peter Wittek, Nicola Pancotti, Patrick Rebentrost, Nathan Wiebe, and Seth Lloyd, “Quantum machine learning,” Nature 549
2017
Earlier work this paper cites.
J. Romero, J. P. Olson, and A. Aspuru-Guzik, “Quantum autoencoders for efficient compression of quantum data,” Quantum Science and Technology 2
2017
Earlier work this paper cites.
Kwok Ho Wan, Oscar Dahlsten, Hlér Kristjánsson, Robert Gardner, and MS Kim, “Quantum generalisation of feedforward neural networks,” npj Quantum Information 3
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
Kristan Temme, Sergey Bravyi, and Jay M Gambetta, “Error mitigation for short-depth quantum circuits,” Physical Review Letters 119
2017
Earlier work this paper cites.
2018
Earlier work this paper cites.
2018
Cited alongside, same era.
Ian D Kivlichan, Jarrod McClean, Nathan Wiebe, Craig Gidney, Alán Aspuru-Guzik, Garnet Kin-Lic Chan, and Ryan Babbush, “Quantum simulation of electronic structure with linear depth and connectivity,” Physical Review Letters 120
2018
Cited alongside, same era.
2018
Cited alongside, same era.
L. Cincio, Y. Subaşı, A. T. Sornborger, and P. J. Coles, “Learning the quantum algorithm for state overlap,” New Journal of Physics 20
2018
Cited alongside, same era.
Wataru Mizukami, Kosuke Mitarai, Yuya O. Nakagawa, Takahiro Yamamoto, Tennin Yan, and Yu-ya Ohnishi, “Orbital optimized unitary coupled cluster theory for quantum computer,” Phys. Rev. Research 2
2020
Closest in time.
Igor O. Sokolov, Panagiotis Kl. Barkoutsos, Pauline J. Ollitrault, Donny Greenberg, Julia Rice, Marco Pistoia, and Ivano Tavernelli, “Quantum orbital-optimized unitary coupled cluster methods in the strongly correlated regime: Can quantum algorithms outperform their classical equivalents?” The Journal of Chemical Physics 152
2020
Closest in time.
Nicholas H Stair, Renke Huang, and Francesco A Evangelista, “A multireference quantum krylov algorithm for strongly correlated electrons,” Journal of Chemical Theory and Computation 16
2020
Closest in time.
2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
K. Mitarai, M. Negoro, M. Kitagawa, and K. Fujii, “Quantum circuit learning,” Phys. Rev. A 98
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Nikolaj Moll, Panagiotis Barkoutsos, Lev S Bishop, Jerry M Chow, Andrew Cross, Daniel J Egger, Stefan Filipp, Andreas Fuhrer, Jay M Gambetta, Marc Ganzhorn, et al. , “Quantum optimization using variational algorithms on near-term quantum devices,” Quantum Science and Technology 3
2018
Cited alongside, same era.
Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, “Quantum approximate optimization algorithm for MaxCut: A fermionic view,” Phys. Rev. A 97
2018
Cited alongside, same era.
Jonathan Romero, Ryan Babbush, Jarrod R McClean, Cornelius Hempel, Peter J Love, and Alán Aspuru-Guzik, “Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz,” Quantum Science and Technology 4
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Closest in time.
2020
Closest in time.
2020
Closest in time.
Nobuyuki Yoshioka, Yuya O Nakagawa, Kosuke Mitarai, and Keisuke Fujii, “Variational quantum algorithm for nonequilibrium steady states,” Physical Review Research 2
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Ken M Nakanishi, Keisuke Fujii, and Synge Todo, “Sequential minimal optimization for quantum-classical hybrid algorithms,” Physical Review Research 2
2020
Closest in time.
2020
Closest in time.
James Stokes, Josh Izaac, Nathan Killoran, and Giuseppe Carleo, “Quantum natural gradient,” Quantum 4
2020
Closest in time.
Jonas M Kübler, Andrew Arrasmith, Lukasz Cincio, and Patrick J Coles, “An adaptive optimizer for measurement-frugal variational algorithms,” Quantum 4
2020
Closest in time.
Ryan Sweke, Frederik Wilde, Johannes Jakob Meyer, Maria Schuld, Paul K Fährmann, Barthélémy Meynard-Piganeau, and Jens Eisert, “Stochastic gradient descent for hybrid quantum-classical optimization,” Quantum 4
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Cristina Cirstoiu, Zoe Holmes, Joseph Iosue, Lukasz Cincio, Patrick J Coles, and Andrew Sornborger, “Variational fast forwarding for quantum simulation beyond the coherence time,” npj Quantum Information 6
2020
Closest in time.
2020
Closest in time.
Sami Khairy, Ruslan Shaydulin, Lukasz Cincio, Yuri Alexeev, and Prasanna Balaprakash, “Learning to optimize variational quantum circuits to solve combinatorial problems,” Proceedings of the AAAI Conference on Artificial Intelligence 34
2020
Closest in time.
Michael Lubasch, Jaewoo Joo, Pierre Moinier, Martin Kiffner, and Dieter Jaksch, “Variational quantum algorithms for nonlinear problems,” Physical Review A 101
2020
Closest in time.
2020
Closest in time.
Jacques Carolan, Masoud Mohseni, Jonathan P Olson, Mihika Prabhu, Changchen Chen, Darius Bunandar, Murphy Yuezhen Niu, Nicholas C Harris, Franco NC Wong, Michael Hochberg, et al. , “Variational quantum unsampling on a quantum photonic processor,” Nature Physics 16
2020
Closest in time.
2020
Closest in time.
Adrián Pérez-Salinas, Alba Cervera-Lierta, Elies Gil-Fuster, and José I Latorre, “Data re-uploading for a universal quantum classifier,” Quantum 4
2020
Closest in time.
2020
Closest in time.
Brian Coyle, Daniel Mills, Vincent Danos, and Elham Kashefi, “The born supremacy: Quantum advantage and training of an ising born machine,” npj Quantum Information 6
2020
Closest in time.
Kerstin Beer, Dmytro Bondarenko, Terry Farrelly, Tobias J Osborne, Robert Salzmann, Daniel Scheiermann, and Ramona Wolf, “Training deep quantum neural networks,” Nature communications 11
2020
Closest in time.
Lukas Franken and Bogdan Georgiev, “Explorations in quantum neural networks with intermediate measurements,” in Proceedings of ESANN (2020)
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Bálint Koczor, Suguru Endo, Tyson Jones, Yuichiro Matsuzaki, and Simon C Benjamin, “Variational-state quantum metrology,” New Journal of Physics 22
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Alexey Uvarov, Jacob D. Biamonte, and Dmitry Yudin, “Variational quantum eigensolver for frustrated quantum systems,” Phys. Rev. B 102
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Leo Zhou, Sheng-Tao Wang, Soonwon Choi, Hannes Pichler, and Mikhail D Lukin, “Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices,” Physical Review X 10
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Chris Cade, Lana Mineh, Ashley Montanaro, and Stasja Stanisic, “Strategies for solving the fermi-hubbard model on near-term quantum computers,” Physical Review B 102
2020
Closest in time.
Vladyslav Verteletskyi, Tzu-Ching Yen, and Artur F Izmaylov, “Measurement optimization in the variational quantum eigensolver using a minimum clique cover,” The Journal of Chemical Physics 152
2020
Closest in time.
Andrew Zhao, Andrew Tranter, William M Kirby, Shu Fay Ung, Akimasa Miyake, and Peter J Love, “Measurement reduction in variational quantum algorithms,” Physical Review A 101
2020
Closest in time.
Tzu-Ching Yen, Vladyslav Verteletskyi, and Artur F Izmaylov, “Measuring all compatible operators in one series of single-qubit measurements using unitary transformations,” Journal of Chemical Theory and Computation 16
2020
Closest in time.
2020
Closest in time.
Hsin-Yuan Huang, Richard Kueng, and John Preskill, “Predicting many properties of a quantum system from very few measurements,” Nature Physics 16
2020
Closest in time.
2020
Closest in time.
Giacomo Torlai, Guglielmo Mazzola, Giuseppe Carleo, and Antonio Mezzacapo, “Precise measurement of quantum observables with neural-network estimators,” Physical Review Research 2
2020
Closest in time.
Laura Gentini, Alessandro Cuccoli, Stefano Pirandola, Paola Verrucchi, and Leonardo Banchi, “Noise-resilient variational hybrid quantum-classical optimization,” Physical Review A 102
2020
Closest in time.
2020
Closest in time.
Jeffrey Marshall, Filip Wudarski, Stuart Hadfield, and Tad Hogg, “Characterizing local noise in QAOA circuits,” IOP SciNotes 1
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Carlos Outeiral, Martin Strahm, Jiye Shi, Garrett M Morris, Simon C Benjamin, and Charlotte M Deane, “The prospects of quantum computing in computational molecular biology,” Wiley Interdisciplinary Reviews: Computational Molecular Science , e1481 (2020)
2020
Closest in time.
Sam McArdle, Suguru Endo, Alan Aspuru-Guzik, Simon C Benjamin, and Xiao Yuan, “Quantum computational chemistry,” Reviews of Modern Physics 92
2020
Closest in time.
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C. Bardin, Rami Barends, Sergio Boixo, et al. , “Hartree-fock on a superconducting qubit quantum computer,” Science 369
2020
Closest in time.
Alessandro Roggero, Andy CY Li, Joseph Carlson, Rajan Gupta, and Gabriel N Perdue, “Quantum computing for neutrino-nucleus scattering,” Physical Review D 101
2020
Closest in time.
Mari Carmen Banuls, Rainer Blatt, Jacopo Catani, Alessio Celi, Juan Ignacio Cirac, Marcello Dalmonte, Leonardo Fallani, Karl Jansen, Maciej Lewenstein, Simone Montangero, et al. , “Simulating lattice gauge theories within quantum technologies,” The European physical journal D 74
2020
Closest in time.
Chinmay Mishra, Shane Thompson, Raphael Pooser, and George Siopsis, “Quantum computation of an interacting fermionic model,” Quantum Science and Technology 5
2020
Closest in time.
2020
Closest in time.
A Avkhadiev, PE Shanahan, and RD Young, “Accelerating lattice quantum field theory calculations via interpolator optimization using noisy intermediate-scale quantum computing,” Physical Review Letters 124
2020
Closest in time.
2020
Closest in time.
Samuel Yen-Chi Chen, Chao-Han Huck Yang, Jun Qi, Pin-Yu Chen, Xiaoli Ma, and Hsi-Sheng Goan, “Variational quantum circuits for deep reinforcement learning,” IEEE Access 8
2020
Closest in time.
2020
Closest in time.
Xiu-Zhe Luo, Jin-Guo Liu, Pan Zhang, and Lei Wang, “Yao. jl: Extensible, efficient framework for quantum algorithm design,” Quantum 4
2020
Closest in time.
Yuval R Sanders, Dominic W Berry, Pedro CS Costa, Louis W Tessler, Nathan Wiebe, Craig Gidney, Hartmut Neven, and Ryan Babbush, “Compilation of fault-tolerant quantum heuristics for combinatorial optimization,” Physical Review X Quantum 1
2020
Closest in time.
Lukasz Cincio, Kenneth Rudinger, Mohan Sarovar, and Patrick J Coles, “Machine learning of noise-resilient quantum circuits,” Phys. Rev. X Quantum 2
2021
Closest in time.
2021
Closest in time.
Alicia B Magann, Christian Arenz, Matthew D Grace, Tak-San Ho, Robert L Kosut, Jarrod R McClean, Herschel A Rabitz, and Mohan Sarovar, “From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms,” Phys. Rev. X Quantum 2
2021
Closest in time.
JinGuo Liu, Liang Mao, Pan Zhang, and Lei Wang, “Solving quantum statistical mechanics with variational autoregressive networks and quantum circuits,” Machine Learning: Science and Technology 2
2021
Closest in time.
2021
Closest in time.
Andrea Mari, Thomas R Bromley, and Nathan Killoran, “Estimating the gradient and higher-order derivatives on quantum hardware,” Physical Review A 103
2021
Closest in time.
2021
Closest in time.
Patrick Huembeli and Alexandre Dauphin, “Characterizing the loss landscape of variational quantum circuits,” Quantum Science and Technology 6
2021
Closest in time.
Jacob Biamonte, “Universal variational quantum computation,” Phys. Rev. A 103
2021
Closest in time.
Guoming Wang, Dax Enshan Koh, Peter D Johnson, and Yudong Cao, “Minimizing estimation runtime on noisy quantum computers,” Phys. Rev. X Quantum 2
2021
Closest in time.
2021
Closest in time.
M. Cerezo, Akira Sone, Tyler Volkoff, Lukasz Cincio, and Patrick J Coles, “Cost function dependent barren plateaus in shallow parametrized quantum circuits,” Nature Communications 12
2021
Closest in time.
Tyler Volkoff and Patrick J Coles, “Large gradients via correlation in random parameterized quantum circuits,” Quantum Science and Technology 6
2021
Closest in time.
Ernesto Campos, Aly Nasrallah, and Jacob Biamonte, “Abrupt transitions in variational quantum circuit training,” Physical Review A 103
2021
Closest in time.
Ophelia Crawford, Barnaby van Straaten, Daochen Wang, Thomas Parks, Earl Campbell, and Stephen Brierley, “Efficient quantum measurement of pauli operators in the presence of finite sampling error,” Quantum 5
2021
Closest in time.
William J Huggins, Jarrod R McClean, Nicholas C Rubin, Zhang Jiang, Nathan Wiebe, K Birgitta Whaley, and Ryan Babbush, “Efficient and noise resilient measurements for quantum chemistry on near-term quantum computers,” npj Quantum Information 7
2021
Closest in time.
Suguru Endo, Zhenyu Cai, Simon C Benjamin, and Xiao Yuan, “Hybrid quantum-classical algorithms and quantum error mitigation,” Journal of the Physical Society of Japan 90
2021
Closest in time.
Jinzhao Sun, Xiao Yuan, Takahiro Tsunoda, Vlatko Vedral, Simon C Benjamin, and Suguru Endo, “Mitigating realistic noise in practical noisy intermediate-scale quantum devices,” Physical Review Applied 15
2021
Closest in time.
Matthew P Harrigan, Kevin J Sung, Matthew Neeley, Kevin J Satzinger, Frank Arute, Kunal Arya, Juan Atalaya, Joseph C Bardin, Rami Barends, Sergio Boixo, et al. , “Quantum approximate optimization of non-planar graph problems on a planar superconducting processor,” Nature Physics , 1–5 (2021)
2021
Closest in time.