Large gradients via correlation in random parameterized quantum circuits
Open accessThe DOI matches its Crossref record; 72 of the 72 references it cites were found in a registry or an index.
Abstract
Scaling of variational quantum algorithms to large problem sizes requires efficient optimization of random parameterized quantum circuits. For such circuits with uncorrelated parameters, the presence of exponentially vanishing gradients in cost function landscapes is an obstacle to optimization by gradient descent methods. In this work, we prove that reducing the dimensionality of the parameter space by utilizing circuit modules containing spatially or temporally correlated gate layers can allow one to circumvent the vanishing gradient phenomenon. Examples are drawn from random separable circuits and asymptotically optimal variational versions of Grover’s algorithm based on the quantum alternating operator ansatz. In the latter scenario, our bounds on cost function variation imply a transition between vanishing gradients and efficient trainability as the number of layers is increased toward O ( 2 n / 2 ) , the optimal oracle complexity of quantum unstructured search.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Based on these observations initialization strategies were proposed and which were heuristically shown to outperform randomly initialized optimizations.”
From Variational quantum algorithms (2021) · cites this paper as [204]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Larger p requires improvements in the parametrization and optimization [204].”
From Variational quantum algorithms (2021) · cites this paper as [204]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The importance of parameter initialization was made clear in Ref. [204] where it was noted that the optimal parameters in QAOA exhibit persistent patterns.”
From Variational quantum algorithms (2021) · cites this paper as [204]
Experimental — accuracy not yet measuredIn the citing paper
“These types of spectra are known to slow down a model's training and may render optimisation suboptimal [31].”
From The power of quantum neural networks (2021) · cites this paper as [31]
In the citing paper
“Classically, the observed Fisher information spectrum is known to have undesirable optimisation properties where the outlying eigenvalues slow down training and loss convergence [31].”
From The power of quantum neural networks (2021) · cites this paper as [31]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552 · cited 2×
“Variational quantum algorithms [1] are a class of quantum algorithms especially suited to near-term applications including eigenvalue estimation [1–7], quantum compiling [8, 9], linear systems [10, 11], and quantum dynamics [12–16].”
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · cited 2×
“[30] Lov K.”
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329 · cited 3×
“BPL are expected in randomly initialized quantum neural networks [22] and, when BPL is avoided for a given cost function, one can consider the cost function to exhibit a large gradient (relative to the generic case).”
InfluentialThe theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860 · cited 2×
“, quantum communication protocols that rely on collective measurements for their efficiency [31]), variational versions require new approaches for avoiding BPL.”
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789 · cited 9×
“For the ring of disagrees problem with 4 ≤ n ≤ 10, we find numerically that maxβ,γ C(L)(β, γ) with (β1 = . . . = βL and γ1 = . . . = γL) is increasing with L, suggesting that in this case, layer-correlated QAOA provides a suboptimal, but low-dimensional, approach to the ring of disagrees problem.”
BackgroundInfluentialQuantum convolutional neural networks
Cong, I., Choi, S., & Lukin, M. D. (2019) · Nature Physics · doi:10.1038/s41567-019-0648-8 · Cited by 1,517 · cited 2×
“[37] I.”
BackgroundThe Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325 · cited 1×
“Examples of quantum algorithm modules involving application of correlated gate layers to a compound quantum register [18] include coherence generation by a tensor product of Hadamard gates in quantum phase estimation [19] and quantum algorithms for linear equations [20], and sequential application…”
Cost function dependent barren plateaus in shallow parametrized quantum circuits
Cerezo, M., Sone, A., Volkoff, T., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-21728-w · Cited by 1,047
Self-citationSim, S., Johnson, P. D., & Aspuru‐Guzik, A. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201900070 · Cited by 972
Quantum Teleportation is a Universal Computational Primitive
Gottesman, D., & Chuang, I. L. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9908010 · Cited by 778 · cited 2×
“, quantum communication protocols that rely on collective measurements for their efficiency [31]), variational versions require new approaches for avoiding BPL.”
Noise-induced barren plateaus in variational quantum algorithms
Wang, S., Fontana, E., Cerezo, M., Sharma, K., Sone, A., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-27045-6 · Cited by 773 · cited 1×
“In fact, a recent analysis of cost functions for a large class of noisy RPQCs (e.g., noisy QAOA) indicate the appearance of BPL for noisy circuit depths scaling at least linearly in n with a noise-dependent coefficient [48].”
Self-citationFrom the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772 · cited 2×
“The alternating structure of the circuit is reminiscent of quantum algorithms based on the quantum alternating operator ansatz (QAOA) [32, 45].”
Efficient Variational Quantum Simulator Incorporating Active Error Minimization
Li, Y., & Benjamin, S. C. (2017) · Physical Review X · doi:10.1103/physrevx.7.021050 · Cited by 686 · cited 2×
“Variational quantum algorithms [1] are a class of quantum algorithms especially suited to near-term applications including eigenvalue estimation [1–7], quantum compiling [8, 9], linear systems [10, 11], and quantum dynamics [12–16].”
BackgroundExact and approximate unitary 2-designs and their application to fidelity estimation
Dankert, C., Cleve, R., Emerson, J., & Livine, E. (2009) · Physical Review A · doi:10.1103/physreva.80.012304 · Cited by 685 · cited 2×
“[43] Christoph Dankert, Richard Cleve, Joseph Emerson, and Etera Livine, “Exact and approximate unitary 2-designs and their application to fidelity estimation,” Phys.”
BackgroundMethodLieb-Robinson Bounds and the Generation of Correlations and Topological Quantum Order
Bravyi, S., Hastings, M. B., & Verstraete, F. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.050401 · Cited by 664 · cited 1×
“However, for quantum algorithms that require polynomial [29] or exponential circuit depth [30], or require the use of a cost function defined by a non-local observable (e.”
Childs, A. M., Kothari, R., & Somma, R. D. (2017) · SIAM Journal on Computing · doi:10.1137/16m1087072 · Cited by 646 · cited 2×
“Examples of quantum algorithm modules involving application of correlated gate layers to a compound quantum register [17] include coherence generation by a tensor product of Hadamard gates in quantum phase estimation [18] and quantum algorithms for linear equations [19], and sequential application of identical two-qub…”
Grover’s quantum searching algorithm is optimal
Zalka, C. (1999) · Physical Review A · doi:10.1103/physreva.60.2746 · Cited by 635 · cited 2×
“We note that although the original Grover’s algorithm is optimal in the sense of having the minimal number of applications of the oracle operation [47], variational versions of Grover’s algorithm are likely to be useful in development of quantum search algorithms with optimal total depth complexity [48].”
Measurement-driven entanglement transition in hybrid quantum circuits
Li, Y., Chen, X., & Fisher, M. P. A. (2019) · Physical Review B · doi:10.1103/physrevb.100.134306 · Cited by 593 · cited 2×
“[27] Yaodong Li, Xiao Chen, and Matthew P.”
Matrix Product State Representations
Perez-Garcia, D., Verstraete, F., Wolf, M., & Cirac, J. I. (2006) · Ghent University Academic Bibliography (Ghent University) · Cited by 565
Theory of variational quantum simulation
Yuan, X., Endo, S., Zhao, Q., Li, Y., & Benjamin, S. C. (2019) · Quantum · doi:10.22331/q-2019-10-07-191 · Cited by 458 · cited 1×
“[13] Xiao Yuan, Suguru Endo, Qi Zhao, Simon Benjamin, and Ying Li, “Theory of variational quantum simulation,” arXiv:1812.”
BackgroundAn initialization strategy for addressing barren plateaus in parametrized quantum circuits
Grant, E., Wossnig, L., Ostaszewski, M., & Benedetti, M. (2019) · Quantum · doi:10.22331/q-2019-12-09-214 · Cited by 406 · cited 1×
“[38] and [39].”
Local Random Quantum Circuits are Approximate Polynomial-Designs
Brandão, F. G. S. L., Harrow, A. W., & Horodecki, M. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2706-8 · Cited by 404 · cited 1×
“Local random quantum circuits on m qubits consisting of O ( t 10 m 2 ) gates suffice to simulate approximate unitary t -designs [53].”
Quantum-assisted quantum compiling
Khatri, S., LaRose, R., Poremba, A., Cincio, L., Sornborger, A. T., & Coles, P. J. (2019) · Quantum · doi:10.22331/q-2019-05-13-140 · Cited by 382 · cited 3×
“Variational quantum algorithms [1] are a class of quantum algorithms especially suited to near-term applications including eigenvalue estimation [1–7], quantum compiling [8, 9], linear systems [10, 11], and quantum dynamics [12–16].”
BackgroundMethodSelf-citationDiVincenzo, D. P., Leung, D. W., & Terhal, B. M. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.985948 · Cited by 362 · cited 2×
“[42] D.”
Sequential Generation of Entangled Multiqubit States
Schön, C., Solano, E., Verstraete, F., Cirac, J. I., & Wolf, M. M. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.110503 · Cited by 349 · cited 2×
“Examples of quantum algorithm modules involving application of correlated gate layers to a compound quantum register [17] include coherence generation by a tensor product of Hadamard gates in quantum phase estimation [18] and quantum algorithms for linear equations [19], and sequential application of identical two-qub…”
MethodAbsence of Barren Plateaus in Quantum Convolutional Neural Networks
Pesah, A., Cerezo, M., Wang, S., Volkoff, T., Sornborger, A. T., & Coles, P. J. (2021) · Physical Review X · doi:10.1103/physrevx.11.041011 · Cited by 343 · cited 1×
“, quantum convolutional neural networks [46] or linear optical transformations of coherent states [47], have been shown to exhibit large gradients even in generic cases.”
Self-citationAbsence of Barren Plateaus in Quantum Convolutional Neural Networks
Pesah, A., Cerezo, M., Wang, S., Volkoff, T., Sornborger, A. T., & Coles, P. J. (2020) · arXiv · doi:10.48550/arxiv.2011.02966 · Cited by 343
Self-citationAn initialization strategy for addressing barren plateaus in parametrized quantum circuits
Grant, E., Wossnig, L., Ostaszewski, M., & Benedetti, M. (2019) · UCL Discovery (University College London) · Cited by 338
Subspace-search variational quantum eigensolver for excited states
Nakanishi, K. M., Mitarai, K., & Fujii, K. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.033062 · Cited by 337 · cited 2×
“Variational quantum algorithms [1] are a class of quantum algorithms especially suited to near-term applications including eigenvalue estimation [1–7], quantum compiling [8, 9], linear systems [10, 11], and quantum dynamics [12–16].”
Layerwise learning for quantum neural networks
Skolik, A., McClean, J. R., Mohseni, M., van der Smagt, P., & Leib, M. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00036-4 · Cited by 324 · cited 1×
“Other methods for increasing trainability of RPQCs include optimization of subsets of parameters [44, 45].”
Divincenzo, D. P., Leung, D., & Terhal, B. M. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 281
Variational quantum algorithms for discovering Hamiltonian spectra
Jones, T., Endo, S., McArdle, S., Yuan, X., & Benjamin, S. C. (2019) · Physical Review A · doi:10.1103/physreva.99.062304 · Cited by 256 · cited 2×
“Variational quantum algorithms [1] are a class of quantum algorithms especially suited to near-term applications including eigenvalue estimation [1–7], quantum compiling [8, 9], linear systems [10, 11], and quantum dynamics [12–16].”
BackgroundVariational fast forwarding for quantum simulation beyond the coherence time
Cîrstoiu, C., Holmes, Z., Iosue, J., Cincio, L., Coles, P. J., & Sornborger, A. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00302-0 · Cited by 232 · cited 1×
“[15] Cristina Cirstoiu, Zoe Holmes, Joseph Iosue, Lukasz Cincio, Patrick J Coles, and Andrew Sornborger, “Variational fast forwarding for quantum simulation beyond the coherence time,” arXiv preprint arXiv:1910.”
BackgroundSelf-citationStochastic gradient descent for hybrid quantum-classical optimization
Sweke, R., Wilde, F., Meyer, J., Schuld, M., Faehrmann, P. K., Meynard-Piganeau, B., & Eisert, J. (2020) · Quantum · doi:10.22331/q-2020-08-31-314 · Cited by 219
An, D., & Lin, L. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3498331 · Cited by 203 · cited 1×
“Variational quantum algorithms are a class of quantum algorithms especially suited to near-term applications including eigenvalue estimation [1–7], quantum compiling [8, 9], linear systems [10–12], and quantum dynamics [13–17].”
Variational quantum state diagonalization
LaRose, R., Tikku, A., O’Neel-Judy, É., Cincio, L., & Coles, P. J. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0167-6 · Cited by 199 · cited 2×
“Variational quantum algorithms [1] are a class of quantum algorithms especially suited to near-term applications including eigenvalue estimation [1–7], quantum compiling [8, 9], linear systems [10, 11], and quantum dynamics [12–16].”
BackgroundSelf-citationNoise resilience of variational quantum compiling
Sharma, K., Khatri, S., Cerezo, M., & Coles, P. J. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab784c · Cited by 196
Self-citationStochastic gradient descent for hybrid quantum-classical optimization
Sweke, R., Sweke, R., Meyer, J. J., Meyer, J. J., Faehrmann, P. K., Meynard-Piganeau, B., & Eisert, J. (2020) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-28427 · Cited by 194
Noise resilience of variational quantum compiling
Sharma, K., Khatri, S., Cerezo, M., & Coles, P. J. (2020) · Civil War Book Review · Cited by 184
Self-citationVariational algorithms for linear algebra
Xu, X., Sun, J., Endo, S., Li, Y., Benjamin, S. C., & Yuan, X. (2021) · Science Bulletin · doi:10.1016/j.scib.2021.06.023 · Cited by 163 · cited 2×
“Variational quantum algorithms [1] are a class of quantum algorithms especially suited to near-term applications including eigenvalue estimation [1–7], quantum compiling [8, 9], linear systems [10, 11], and quantum dynamics [12–16].”
BackgroundNear-optimal quantum circuit for Grover's unstructured search using a transverse field
Jiang, Z., Rieffel, E. G., & Wang, Z. (2017) · Physical Review A · doi:10.1103/physreva.95.062317 · Cited by 142 · cited 6×
“A near-optimal version of Grover’s algorithm has been proposed which utilizes a quantum circuit consisting of alternating applications of the local rotation U = e− 2πi n Jy and the Grover oracle V = I− 2 |0〉〈0| [33].”
InfluentialAn Adaptive Optimizer for Measurement-Frugal Variational Algorithms
Kübler, J. M., Arrasmith, A., Cincio, L., & Coles, P. J. (2020) · Quantum · doi:10.22331/q-2020-05-11-263 · Cited by 141
Self-citationVariational quantum state eigensolver
Cerezo, M., Sharma, K., Arrasmith, A., & Coles, P. J. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00611-6 · Cited by 136 · cited 2×
“, quantum data bus ansatze for variational quantum state preparation [41], or layered hardware-efficient ansatze that appear in variational quantum algorithms for spectrum estimation [6].”
BackgroundSelf-citationGlobally Controlled Quantum Wires for Perfect Qubit Transport, Mirroring, and Computing
Fitzsimons, J., & Twamley, J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.090502 · Cited by 121 · cited 2×
“) appear in the transition functions that define 1-D quantum cellular automata [35], in algorithms for quantum state transfer [36], and quantum convolutional neural networks [37].”
BackgroundHarrow, A. W., & Napp, J. C. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.140502 · Cited by 121 · cited 1×
“[25] Aram Harrow and John Napp, “Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms,” arXiv:1901.”
Expressibility of the alternating layered ansatz for quantum computation
Nakaji, K., & Yamamoto, N. (2021) · Quantum · doi:10.22331/q-2021-04-19-434 · Cited by 119
Local asymptotic normality for qubit states
Guţǎ, M., & Kahn, J. (2006) · Physical Review A · doi:10.1103/physreva.73.052108 · Cited by 103 · cited 2×
“[40] M.”
BackgroundLearning Unitaries by Gradient DescentPreprint
Kiani, B. T., Lloyd, S., & Maity, R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.11897 · Cited by 88 · cited 1×
“, unitaries of the form (WT ) 2 where W , T are random 2 × 2 unitary matrices and d is the Hilbert space dimension) [46].”
BackgroundCost-Function-Dependent Barren Plateaus in Shallow Quantum Neural Networks.Preprint
Cerezo, M., Sone, A., Volkoff, T. J., Cincio, Ł., & Coles, P. J. (2020) · arXiv (Cornell University) · Cited by 83
Self-citationLearning to learn with quantum neural networks via classical neural networks
Verdon, G., Broughton, M., McClean, J. R., Sung, K. J., Babbush, R., Zhang, J., Neven, H., & Mohseni, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.05415 · Cited by 73 · cited 1×
“[39] Guillaume Verdon, Michael Broughton, Jarrod R McClean, Kevin J Sung, Ryan Babbush, Zhang Jiang, Hartmut Neven, and Masoud Mohseni, “Learning to learn with quantum neural networks via classical neural networks,” arXiv preprint arXiv:1907.”
BackgroundDepth optimization of quantum search algorithms beyond Grover's algorithm
Zhang, K., & Korepin, V. E. (2020) · Physical Review A · doi:10.1103/physreva.101.032346 · Cited by 70 · cited 2×
“We note that although the original Grover’s algorithm is optimal in the sense of having the minimal number of applications of the oracle operation [47], variational versions of Grover’s algorithm are likely to be useful in development of quantum search algorithms with optimal total depth complexity [48].”
Variational consistent histories as a hybrid algorithm for quantum foundations
Arrasmith, A., Cincio, L., Sornborger, A. T., Zurek, W. H., & Coles, P. J. (2019) · Nature Communications · doi:10.1038/s41467-019-11417-0 · Cited by 66 · cited 2×
“Variational quantum algorithms [1] are a class of quantum algorithms especially suited to near-term applications including eigenvalue estimation [1–7], quantum compiling [8, 9], linear systems [10, 11], and quantum dynamics [12–16].”
BackgroundSelf-citationAdaptive pruning-based optimization of parameterized quantum circuits
Sim, S., Romero, J., Gonthier, J. F., & Kunitsa, A. A. (2020) · arXiv · doi:10.48550/arxiv.2010.00629 · Cited by 66
Quantum approximate optimization is computationally universal
Lloyd, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.11075 · Cited by 64
Near-term quantum algorithms for linear systems of equations
Huang, H.-Y., Bharti, K., & Rebentrost, P. (2019) · arXiv · doi:10.48550/arxiv.1909.07344 · Cited by 62
Variational learning of Grover's quantum search algorithm
Morales, M. E. S., Tlyachev, T., & Biamonte, J. (2018) · Physical Review A · doi:10.1103/physreva.98.062333 · Cited by 57 · cited 2×
“Finally, our main result consists of a proof that QAOAinspired variational versions of Grover’s algorithm [33, 34] exhibit a transition from BPL at low circuit depths to trainability at circuit depths that coincide with a high algorithm success rate (Section V).”
Subspace variational quantum simulator
Heya, K., Nakanishi, K. M., Mitarai, K., Yan, Z., Zuo, K., Suzuki, Y., Sugiyama, T., Tamate, S., Tabuchi, Y., Fujii, K., et al. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023078 · Cited by 56 · cited 1×
“[14] Kentaro Heya, Ken M Nakanishi, Kosuke Mitarai, and Keisuke Fujii, “Subspace variational quantum simulator,” arXiv preprint arXiv:1904.”
BackgroundAdaptive pruning-based optimization of parameterized quantum circuits
Sim, S., Romero, J., Gonthier, J. F., & Kunitsa, A. A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abe107 · Cited by 56
Subspace Variational Quantum Simulator
Heya, K., Nakanishi, K. M., Mitarai, K., Yan, Z., Zuo, K., Suzuki, Y., Sugiyama, T., Tamate, S., Tabuchi, Y., Fujii, K., et al. (2019) · arXiv · doi:10.48550/arxiv.1904.08566 · Cited by 56 · cited 1×
“[14] Kentaro Heya, Ken M Nakanishi, Kosuke Mitarai, and Keisuke Fujii, “Subspace variational quantum simulator,” arXiv preprint arXiv:1904.”
BackgroundQuantum computation via translation-invariant operations on a chain of qubits
Raussendorf, R. (2005) · Physical Review A · doi:10.1103/physreva.72.052301 · Cited by 55 · cited 2×
“[35] Robert Raussendorf, “Quantum computation via translation-invariant operations on a chain of qubits,” Phys.”
BackgroundOperator Sampling for Shot-frugal Optimization in Variational Algorithms
Arrasmith, A., Cincio, L., Somma, R. D., & Coles, P. J. (2020) · arXiv · doi:10.48550/arxiv.2004.06252 · Cited by 53 · cited 1×
“[24] Andrew Arrasmith, Lukasz Cincio, Rolando D Somma, and Patrick J Coles, “Operator sampling for shot-frugal optimization in variational algorithms,” arXiv preprint arXiv:2004.”
Self-citationEntanglement-Induced Barren Plateaus
Ortiz Marrero, C., Kieferová, M., & Wiebe, N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040316 · Cited by 39
Mitarai, K., Suzuki, Y., Mizukami, W., Nakagawa, Y. O., & Fujii, K. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033012 · Cited by 39 · cited 1×
“The ansatz initialization scheme in reference [42] assumes that the RPQC is a Clifford circuit for some parameter value, which implies that cost function derivatives can locally be computed efficiently.”
Variational Quantum Linear Solver: A Hybrid Algorithm for Linear SystemsPreprint
Bravo-Prieto, C., LaRose, R., Cerezo, M., Subaşı, Y., Cincio, Ł., & Coles, P. J. (2019) · arXiv (Cornell University) · Cited by 35
Self-citationNoise-Resilient Quantum Dynamics Using Symmetry-Preserving Ansatzes
Otten, M., Cortes, C. L., & Gray, S. K. (2019) · arXiv · doi:10.48550/arxiv.1910.06284 · Cited by 30 · cited 1×
“[16] Matthew Otten, Cristian L Cortes, and Stephen K Gray, “Noise-resilient quantum dynamics using symmetrypreserving ansatzes,” arXiv preprint arXiv:1910.”
Variational quantum state preparation via quantum data buses
Kuzmin, V. V., & Silvi, P. (2020) · Quantum · doi:10.22331/q-2020-07-06-290 · Cited by 17 · cited 1×
“, quantum data bus ansatze for variational quantum state preparation [41], or layered hardware-efficient ansatze that appear in variational quantum algorithms for spectrum estimation [6].”
Efficient Trainability of Linear Optical Modules in Quantum Optical Neural Networks
Volkoff, T. J. (2021) · Journal of Russian Laser Research · doi:10.1007/s10946-021-09958-1 · Cited by 16 · cited 1×
“, quantum convolutional neural networks [46] or linear optical transformations of coherent states [47], have been shown to exhibit large gradients even in generic cases.”
Self-citationVariational Fast Forwarding for Quantum Simulation Beyond the Coherence TimePreprint
Cîrstoiu, C., Holmes, Z., Iosue, J. T., Cincio, Ł., Coles, P. J., & Sornborger, A. T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.04292 · Cited by 7 · cited 1×
“[15] Cristina Cirstoiu, Zoe Holmes, Joseph Iosue, Lukasz Cincio, Patrick J Coles, and Andrew Sornborger, “Variational fast forwarding for quantum simulation beyond the coherence time,” arXiv preprint arXiv:1910.”
BackgroundSelf-citationMitarai, K., Suzuki, Y., Mizukami, W., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.09927 · Cited by 6 · cited 1×
“The ansatz initialization scheme in reference [42] assumes that the RPQC is a Clifford circuit for some parameter value, which implies that cost function derivatives can locally be computed efficiently.”
Efficient trainability of linear optical modules in quantum optical neural networksPreprint
Volkoff, T. J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.09173 · Cited by 1 · cited 1×
“, quantum convolutional neural networks [46] or linear optical transformations of coherent states [47], have been shown to exhibit large gradients even in generic cases.”
Self-citation
Research works printed but not linked: 1
- Nielsen M A and Chuang I L 2011 Quantum Computation and Quantum Information (Cambridge: Cambridge University Press)
Cited by
Variational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385
“For instance, the proposal of [177] showed that correlating the parameters in the ansatz effectively reduces the dimension of the hyperparameter space and can lead to large cost function gradients.”
BackgroundSelf-citationNoisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
The power of quantum neural networks
Abbas, A., Sutter, D., Zoufal, C., Lucchi, A., Figalli, A., & Woerner, S. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00084-1 · Cited by 1,082
Cost function dependent barren plateaus in shallow parametrized quantum circuits
Cerezo, M., Sone, A., Volkoff, T., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-21728-w · Cited by 1,047
“Finally, we remark that some strategies have been developed to mitigate the effects of barren plateaus 32,33,53,54 .”
BackgroundSelf-citationThe Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Metadata
- Authors
- Volkoff, T., & Coles, P. J.
- Affiliations
- Los Alamos National Laboratory (US)
- Corresponding author
- Volkoff, Tyler
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2021-01-18
- Volume
- 6
- Issue
- 2
- Pages
- 025008
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W3026863321
- Cited by
- 143
- References
- 71
- Citations by year
- 2026: 12 · 2025: 16 · 2024: 32 · 2023: 19 · 2022: 35 · 2021: 27
- FWCI
- 9.99
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- publishingsupport.iopscience.iop.org/iop-standard/v1 (vor)
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- Locations
- Quantum Science and Technology (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- arXiv (Cornell University)
- Funders
- U.S. Department of Energy (#89233218CNA000001)
- Office of Science (89233218CNA000001)
- National Nuclear Security Administration (89233218C-NA000001)
- Advanced Scientific Computing Research (89233218CNA000001)
- Laboratory Directed Research and Development (89233218CNA000001)
- Los Alamos National Laboratory (89233218CNA 000001)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- gradient vanishing, variational quantum circuits, variational quantum algorithms, gradient descent, Grover's algorithm, Quantum Alternating Operator Ansatz, trainability, oracle complexity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.