Fetching the paper…
Reading the bibliography…
Inspired by the Fleming-Viot stochastic process, we propose a parallel implementation of variational quantum algorithms with the aim of reducing the time spent by the algorithm in barren plateaus, where optimization direction is unclear.
Z. Ciesielski and S. Taylor, “First passage times and sojourn times for Brownian motion in space and the exact hausdorff measure of the sample path,” Transactions of the American Mathematical Society , vol. 103, no. 3, pp. 434–450, 1962
1962
Earlier work this paper cites.
M. Pincus, “Letter to the editor—a monte carlo method for the approximate solution of certain types of constrained optimization problems,” Operations Research , vol. 18, no. 6, pp. 1225–1228, Dec. 1970. [Online]. Available: https://doi.org/10.1287/opre.18.6.1225
1970
Earlier work this paper cites.
W. Fleming and M. Viot, “Some measure-valued Markov processes in population genetics theory,” Indiana Univ. Math. J. , vol. 28, no. 5, pp. 817–843, 1979. [Online]. Available: http://dx.doi.org/10.1512/iumj.1979.28.28058
1979
Earlier work this paper cites.
A. Khachaturyan, S. Semenovsovskaya, and B. Vainshtein, “The thermodynamic approach to the structure analysis of crystals,” Acta Crystallographica Section A , vol. 37, no. 5, pp. 742–754, Sep. 1981. [Online]. Available: https://doi.org/10.1107/s0567739481001630
1981
Earlier work this paper cites.
P. J. M. van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications . Springer Netherlands, 1987. [Online]. Available: https://doi.org/10.1007/978-94-015-7744-1
1987
Earlier work this paper cites.
K. Burdzy, R. Holyst, and P. March, “A Fleming-Viot particle representation of the Dirichlet Laplacian,” Comm. Math. Phys. , vol. 214, no. 3, pp. 679–703, 2000. [Online]. Available: http://dx.doi.org/10.1007/s002200000294
2000
Earlier work this paper cites.
I. Grigorescu and M. Kang, “Hydrodynamic limit for a fleming–viot type system,” Stochastic processes and their applications , vol. 110, no. 1, pp. 111–143, 2004
2004
Earlier work this paper cites.
N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, and M. R. Tuttle, “Many random walks are faster than one,” in Proceedings of the twentieth annual symposium on parallelism in algorithms and architectures , 2008, pp. 119–128
2008
Earlier work this paper cites.
R. MartÃ, M. G. Resende, and C. C. Ribeiro, “Multi-start methods for combinatorial optimization,” European Journal of Operational Research , vol. 226, no. 1, pp. 1–8, 2013. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0377221712007394
2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
J. R. McClean, J. Romero, R. Babbush, and A. Aspuru-Guzik, “The theory of variational hybrid quantum-classical algorithms,” New Journal of Physics , vol. 18, no. 2, p. 023023, 2016
2016
Earlier work this paper cites.
P. J. O’Malley, R. Babbush, I. D. Kivlichan, J. Romero, J. R. McClean, R. Barends, J. Kelly, P. Roushan, A. Tranter, N. Ding et al. , “Scalable quantum simulation of molecular energies,” Phys. Rev. X , vol. 6, no. 3, p. 031007, 2016
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 , vol. 549, no. 7671, pp. 242–246, 2017
2017
Earlier work this paper cites.
J. Preskill, “Quantum computing in the NISQ era and beyond,” Quantum , vol. 2, p. 79, aug 2018. [Online]. Available: https://doi.org/10.22331%2Fq-2018-08-06-79
2018
Earlier work this paper cites.
J. Colless, V. Ramasesh, D. Dahlen, M. Blok, M. Kimchi-Schwartz, J. McClean, J. Carter, W. de Jong, and I. Siddiqi, “Computation of molecular spectra on a quantum processor with an error-resilient algorithm,” Phys. Rev. X , vol. 8, no. 1, Feb. 2018. [Online]. Available: https://doi.org/10.1103/physrevx.8.011021
2018
Earlier work this paper cites.
Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, “Quantum approximate optimization algorithm for maxcut: A fermionic view,” Phys. Rev. A , vol. 97, no. 2, p. 022304, 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
N. Moll, P. Barkoutsos, L. S. Bishop, J. M. Chow, A. Cross, D. J. Egger, S. Filipp, A. Fuhrer, J. M. Gambetta, M. Ganzhorn et al. , “Quantum optimization using variational algorithms on near-term quantum devices,” Quantum Science and Technology , vol. 3, no. 3, p. 030503, 2018
2018
Earlier work this paper cites.
P.-L. Dallaire-Demers and N. Killoran, “Quantum generative adversarial networks,” Phys. Rev. A , vol. 98, no. 1, p. 012324, 2018
2018
Earlier work this paper cites.
J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, “Barren plateaus in quantum neural network training landscapes,” Nature communications , vol. 9, no. 1, p. 4812, 2018
2018
Earlier work this paper cites.
G. G. Guerreschi and A. Y. Matsuura, “Qaoa for max-cut requires hundreds of qubits for quantum speed-up,” Scientific Reports , vol. 9, no. 1, May 2019. [Online]. Available: http://dx.doi.org/10.1038/s41598-019-43176-9
2019
Earlier work this paper cites.
A. J. McCaskey, Z. P. Parks, J. Jakowski, S. V. Moore, T. D. Morris, T. S. Humble, and R. C. Pooser, “Quantum chemistry as a benchmark for near-term quantum computers,” npj Quantum Information , vol. 5, no. 1, p. 99, 2019
2019
Earlier work this paper cites.
C. Kokail, C. Maier, R. van Bijnen, T. Brydges, M. K. Joshi, P. Jurcevic, C. A. Muschik, P. Silvi, R. Blatt, C. F. Roos et al. , “Self-verifying variational quantum simulation of lattice models,” Nature , vol. 569, no. 7756, pp. 355–360, 2019
2019
Earlier work this paper cites.
M. Schuld and N. Killoran, “Quantum machine learning in feature hilbert spaces,” Phys. Rev. Lett. , vol. 122, no. 4, p. 040504, 2019
2019
Earlier work this paper cites.
V. Havlíček, A. D. Córcoles, K. Temme, A. W. Harrow, A. Kandala, J. M. Chow, and J. M. Gambetta, “Supervised learning with quantum-enhanced feature spaces,” Nature , vol. 567, no. 7747, pp. 209–212, 2019
2019
Earlier work this paper cites.
M. Benedetti, D. Garcia-Pintos, O. Perdomo, V. Leyton-Ortega, Y. Nam, and A. Perdomo-Ortiz, “A generative modeling approach for benchmarking and training shallow quantum circuits,” npj Quantum Information , vol. 5, no. 1, p. 45, 2019
2019
Earlier work this paper cites.
E. Grant, L. Wossnig, M. Ostaszewski, and M. Benedetti, “An initialization strategy for addressing barren plateaus in parametrized quantum circuits,” Quantum , vol. 3, p. 214, 2019
2019
Earlier work this paper cites.
2019
Cited alongside, same era.
S. McArdle, S. Endo, A. Aspuru-Guzik, S. C. Benjamin, and X. Yuan, “Quantum computational chemistry,” Reviews of Modern Physics , vol. 92, no. 1, p. 015003, 2020
2020
Cited alongside, same era.
Google AI Quantum and Collaborators, F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, S. Boixo, M. Broughton, B. B. Buckley et al. , “Hartree-fock on a superconducting qubit quantum computer,” Science , vol. 369, no. 6507, pp. 1084–1089, 2020
2020
Cited alongside, same era.
C. Lyu, V. Montenegro, and A. Bayat, “Accelerated variational algorithms for digital quantum simulation of many-body ground states,” Quantum , vol. 4, p. 324, 2020
2020
Cited alongside, same era.
T. Haug and K. Bharti, “Generalized quantum assisted simulator,” Quantum Science and Technology , vol. 7, no. 4, p. 045019, 2022
2022
Later among the works it cites.
S. Brandhofer, D. Braun, V. Dehn, G. Hellstern, M. Hüls, Y. Ji, I. Polian, A. S. Bhatia, and T. Wellens, “Benchmarking the performance of portfolio optimization with qaoa,” Quantum Information Processing , vol. 22, no. 1, p. 25, 2022
2022
Later among the works it cites.
L. Zhu, H. L. Tang, G. S. Barron, F. A. Calderon-Vargas, N. J. Mayhall, E. Barnes, and S. E. Economou, “Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer,” Phys. Rev. Res. , vol. 4, p. 033029, Jul 2022. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevResearch.4.033029
2022
Later among the works it cites.
E. Y. Zhu, S. Johri, D. Bacon, M. Esencan, J. Kim, M. Muir, N. Murgai, J. Nguyen, N. Pisenti, A. Schouela, K. Sosnova, and K. Wright, “Generative quantum learning of joint probability distribution functions,” Phys. Rev. Res. , vol. 4, p. 043092, Nov 2022. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevResearch.4.043092
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Lubasch, J. Joo, P. Moinier, M. Kiffner, and D. Jaksch, “Variational quantum algorithms for nonlinear problems,” Phys. Rev. A , vol. 101, p. 010301, Jan 2020. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.101.010301
2020
Cited alongside, same era.
Y. Du, M.-H. Hsieh, T. Liu, and D. Tao, “Expressive power of parametrized quantum circuits,” Phys. Rev. Res. , vol. 2, no. 3, p. 033125, 2020
2020
Cited alongside, same era.
J. Bausch, “Recurrent quantum neural networks,” in Advances in Neural Information Processing Systems , H. Larochelle, M. Ranzato, R. Hadsell, M. Balcan, and H. Lin, Eds., vol. 33. Curran Associates, Inc., 2020, pp. 1368–1379
2020
Cited alongside, same era.
H.-Y. Huang, R. Kueng, and J. Preskill, “Predicting many properties of a quantum system from very few measurements,” Nature Physics , vol. 16, no. 10, pp. 1050–1057, 2020
2020
Cited alongside, same era.
X. Chen, S. S. Du, and X. T. Tong, “On stationary-point hitting time and ergodicity of stochastic gradient langevin dynamics,” Journal of Machine Learning Research , 2020
2020
Cited alongside, same era.
L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, “Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices,” Phys. Rev. X , vol. 10, no. 2, p. 021067, 2020
2020
Cited alongside, same era.
M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio et al. , “Variational quantum algorithms,” Nature Reviews Physics , vol. 3, no. 9, pp. 625–644, 2021
2021
Cited alongside, same era.
D. J. Egger, J. Mareček, and S. Woerner, “Warm-starting quantum optimization,” Quantum , vol. 5, p. 479, 2021
2021
Cited alongside, same era.
2022
Later among the works it cites.
2022
Later among the works it cites.
M. Larocca, P. Czarnik, K. Sharma, G. Muraleedharan, P. J. Coles, and M. Cerezo, “Diagnosing barren plateaus with tools from quantum optimal control,” Quantum , vol. 6, p. 824, 2022
2022
Later among the works it cites.
Z. Holmes, K. Sharma, M. Cerezo, and P. J. Coles, “Connecting ansatz expressibility to gradient magnitudes and barren plateaus,” PRX Quantum , vol. 3, no. 1, p. 010313, 2022
2022
Later among the works it cites.
S. H. Sack, R. A. Medina, A. A. Michailidis, R. Kueng, and M. Serbyn, “Avoiding barren plateaus using classical shadows,” PRX Quantum , vol. 3, p. 020365, Jun 2022. [Online]. Available: https://link.aps.org/doi/10.1103/PRXQuantum.3.020365
2022
Later among the works it cites.
K. Zhang, L. Liu, M.-H. Hsieh, and D. Tao, “Escaping from the barren plateau via gaussian initializations in deep variational quantum circuits,” Advances in Neural Information Processing Systems , vol. 35, pp. 18 612–18 627, 2022
2022
Later among the works it cites.
L. Friedrich and J. Maziero, “Avoiding barren plateaus with classical deep neural networks,” Phys. Rev. A , vol. 106, no. 4, p. 042433, 2022
2022
Later among the works it cites.
A. Budhiraja, N. Fraiman, and A. Waterbury, “Approximating quasi-stationary distributions with interacting reinforced random walks,” ESAIM: Probability and Statistics , vol. 26, pp. 69–125, 2022
2022
Later among the works it cites.
Y. Zhang, P. Liang, and M. Charikar, “A hitting time analysis of stochastic gradient langevin dynamics,” in Conference on Learning Theory . PMLR, 2017, pp. 1980–2022
2022
Later among the works it cites.
M. Gong, H.-L. Huang, S. Wang, C. Guo, S. Li, Y. Wu, Q. Zhu, Y. Zhao, S. Guo, H. Qian et al. , “Quantum neuronal sensing of quantum many-body states on a 61-qubit programmable superconducting processor,” Science Bulletin , vol. 68, no. 9, pp. 906–912, 2023
2023
Closest in time.
S. Boulebnane and A. Montanaro, “Solving boolean satisfiability problems with the quantum approximate optimization algorithm,” 2022, presented at QIP 2023
2023
Closest in time.
C. Bravo-Prieto, R. LaRose, M. Cerezo, Y. Subasi, L. Cincio, and P. J. Coles, “Variational quantum linear solver,” Quantum , vol. 7, p. 1188, 2023
2023
Closest in time.
X. Hou, G. Zhou, Q. Li, S. Jin, and X. Wang, “A duplication-free quantum neural network for universal approximation,” Science China Physics, Mechanics & Astronomy , vol. 66, no. 7, p. 270362, 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
A. Abbas, A. Ambainis, B. Augustino, A. Bärtschi, H. Buhrman, C. Coffrin, G. Cortiana, V. Dunjko, D. J. Egger, B. G. Elmegreen, N. Franco, F. Fratini, B. Fuller, J. Gacon, C. Gonciulea, S. Gribling, S. Gupta, S. Hadfield, R. Heese, G. Kircher, T. Kleinert, T. Koch, G. Korpas, S. Lenk, J. Marecek, V. Markov, G. Mazzola, S. Mensa, N. Mohseni, G. Nannicini, C. O’Meara, E. P. Tapia, S. Pokutta, M. Proissl, P. Rebentrost, E. Sahin, B. C. B. Symons, S. Tornow, V. Valls, S. Woerner, M. L. Wolf-Bauwens, J. Yard, S. Yarkoni, D. Zechiel, S. Zhuk, and C. Zoufal, “Challenges and opportunities in quantum optimization,” Nature Reviews Physics , vol. 6, no. 12, p. 718–735, Oct. 2024. [Online]. Available: http://dx.doi.org/10.1038/s42254-024-00770-9
2024
Closest in time.
E. A. Cherrat, I. Kerenidis, N. Mathur, J. Landman, M. Strahm, and Y. Y. Li, “Quantum vision transformers,” Quantum , vol. 8, no. arXiv: 2209.08167, p. 1265, 2024
2024
Closest in time.
J. Aspman, G. Korpas, and J. Marecek, “Taming binarized neural networks and mixed-integer programs,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 38, no. 10, 2024, pp. 10 935–10 943
2024
Closest in time.
V. Kungurtsev, G. Korpas, J. Marecek, and E. Y. Zhu, “Iteration complexity of variational quantum algorithms,” Quantum , vol. 8, p. 1495, 2024
2024
Closest in time.
L. Binkowski, G. Koßmann, T. Ziegler, and R. Schwonnek, “Elementary proof of qaoa convergence,” New Journal of Physics , vol. 26, no. 7, p. 073001, 2024
2024
Closest in time.
E. Fontana, D. Herman, S. Chakrabarti, N. Kumar, R. Yalovetzky, J. Heredge, S. H. Sureshbabu, and M. Pistoia, “Characterizing barren plateaus in quantum ansätze with the adjoint representation,” Nature Communications , vol. 15, no. 1, p. 7171, 2024
2024
Closest in time.
F. Sauvage, M. Larocca, P. J. Coles, and M. Cerezo, “Building spatial symmetries into parameterized quantum circuits for faster training,” Quantum Science and Technology , vol. 9, no. 1, p. 015029, Jan. 2024
2024
Closest in time.
M. Schumann, F. K. Wilhelm, and A. Ciani, “Emergence of noise-induced barren plateaus in arbitrary layered noise models,” Quantum Science and Technology , vol. 9, no. 4, p. 045019, 2024
2024
Closest in time.