Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 65 of the 65 references it cites were found in a registry or an index.

An efficient quantum algorithm for the time evolution of parameterized circuits

Open access

Abstract

We introduce a novel hybrid algorithm to simulate the real-time evolution of quantum systems using parameterized quantum circuits. The method, named "projected – Variational Quantum Dynamics" (p-VQD) realizes an iterative, global projection of the exact time evolution onto the parameterized manifold. In the small time-step limit, this is equivalent to the McLachlan's variational principle. Our approach is efficient in the sense that it exhibits an optimal linear scaling with the total number of variational parameters. Furthermore, it is global in the sense that it uses the variational principle to optimize all parameters at once. The global nature of our approach then significantly extends the scope of existing efficient variational methods, that instead typically rely on the iterative optimization of a restricted subset of variational parameters. Through numerical experiments, we also show that our approach is particularly advantageous over existing global optimization algorithms based on the time-dependent variational principle that, due to a demanding quadratic scaling with parameter numbers, are unsuitable for large parameterized quantum circuits.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.22331/q-2021-07-28-512

Cites

65 of 65 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Sketch of the p-VQD algorithm. We follow the real time evolution of the ansatz state ψ w ( t ) in the Hilbert space by optimizing the parameter variation dw at every time step. The optimisation is performed through the gradient of the step-infidelity function L ( dw,δt ) , computed using a quantum computer.
Figure 1 Sketch of the p-VQD algorithm. We follow the real time evolution of the ansatz state ψ w ( t ) in the Hilbert space by optimizing the parameter variation dw at every time step. The optimisation is performed through the gradient of the step-infidelity function L ( dw,δt ) , computed using a quantum computer.CC-BY · From the PDF
Figure 2 Mean error on fidelity accumulated over an entire time evolution for the two different methods. The plot shows, as a function of the total samples required, the fidelity error accumulated by the algorithm over an entire time evolution. The total time of evolution is T e = 3 , the number of time steps is n steps = 60 , the number of spins is N = 3 and the ansatz chosen is the custom one with d = 3 for both p-VQD and TDVA. For each number of samples the experiment has been iterated n iter = 10 times and the data shown represent mean and standard deviation of those values.
Figure 2 Mean error on fidelity accumulated over an entire time evolution for the two different methods. The plot shows, as a function of the total samples required, the fidelity error accumulated by the algorithm over an entire time evolution. The total time of evolution is T e = 3 , the number of time steps is n steps = 60 , the number of spins is N = 3 and the ansatz chosen is the custom one with d = 3 for both p-VQD and TDVA. For each number of samples the experiment has been iterated n iter = 10 times and the data shown represent mean and standard deviation of those values.CC-BY · From the PDF
Figure 3 Total magnetization measured on simulated time evolution. The plot shows the expectation values of Pauli operators for systems simulated with p-VQD and TDVA at different shot number. The magnetization is evaluated on a chain of N = 3 spins and we used the custom ansatz with d = 3 for both the algorithms. We indicated the number of shots for circuit evaluation instead of total samples: 800 , 8000 and 80000 shots are equivalent to ∼ 10 6 , 10 7 , 10 8 total samples for the p-VQD and ∼ 10 7 , 10 8 , 10 9 for the TDVA, respectively.
Figure 3 Total magnetization measured on simulated time evolution. The plot shows the expectation values of Pauli operators for systems simulated with p-VQD and TDVA at different shot number. The magnetization is evaluated on a chain of N = 3 spins and we used the custom ansatz with d = 3 for both the algorithms. We indicated the number of shots for circuit evaluation instead of total samples: 800 , 8000 and 80000 shots are equivalent to ∼ 10 6 , 10 7 , 10 8 total samples for the p-VQD and ∼ 10 7 , 10 8 , 10 9 for the TDVA, respectively.CC-BY · From the PDF
Figure 4 Number of optimisation steps required (top) to decrease accuracy error per step (bottom). The algorithm optimizes the parameters shift dw until the step-infidelity L ( dw,δt e ) is below the threshold at 10 -5 . The time step chosen is δt e = 0 . 05 . The analysis is performed on a statevector simulation of a system of N = 3 spins, using the custom ansatz with depth d = 3 .
Figure 4 Number of optimisation steps required (top) to decrease accuracy error per step (bottom). The algorithm optimizes the parameters shift dw until the step-infidelity L ( dw,δt e ) is below the threshold at 10 -5 . The time step chosen is δt e = 0 . 05 . The analysis is performed on a statevector simulation of a system of N = 3 spins, using the custom ansatz with depth d = 3 .CC-BY · From the PDF
Figure 5 Measurements required as a function of circuit parameters. The plot shows the total number of circuits created and measured using p-VQD and TDVA. The number of required measurements by the TDVA is fixed, while in the p-VQD it depends on the optimisation of the parameter variation. We fixed the number of spins at N = 3 and increased the depth of the custom ansatz from d = 2 to d = 8 ; the parameters varied accordingly. We considered n shots = 8000 per circuit evaluation for both methods and performed multiple simulations for p-VQD, showing mean values and standard deviations of the results. Different error on the accuracy per step are showed for p-VQD.
Figure 5 Measurements required as a function of circuit parameters. The plot shows the total number of circuits created and measured using p-VQD and TDVA. The number of required measurements by the TDVA is fixed, while in the p-VQD it depends on the optimisation of the parameter variation. We fixed the number of spins at N = 3 and increased the depth of the custom ansatz from d = 2 to d = 8 ; the parameters varied accordingly. We considered n shots = 8000 per circuit evaluation for both methods and performed multiple simulations for p-VQD, showing mean values and standard deviations of the results. Different error on the accuracy per step are showed for p-VQD.CC-BY · From the PDF
Figure 6 Optimisation steps required per time step when increasing the qubits number. The plot compares the use of the global and the local cost function in the optimisation process of two different time steps. The analysis is performed using the state-vector simulator and an accuracy per step of 10 -5 . The ansatz has α = x at every layer and d = 3 . The number of parameters varies accordingly. The two cost functions show similar performances in the number of iterations required.
Figure 6 Optimisation steps required per time step when increasing the qubits number. The plot compares the use of the global and the local cost function in the optimisation process of two different time steps. The analysis is performed using the state-vector simulator and an accuracy per step of 10 -5 . The ansatz has α = x at every layer and d = 3 . The number of parameters varies accordingly. The two cost functions show similar performances in the number of iterations required.CC-BY · From the PDF
Figure 7 Infidelity as a function of the optimisation step. The optimisation procedure requires only a few optimisation steps to greatly decrease the step-infidelity. Moreover, we compare the random choice of an initial dw 0 of order O ( δt ) to the educated guess dw 0 = dw ⋆ ( t -δt ) .
Figure 7 Infidelity as a function of the optimisation step. The optimisation procedure requires only a few optimisation steps to greatly decrease the step-infidelity. Moreover, we compare the random choice of an initial dw 0 of order O ( δt ) to the educated guess dw 0 = dw ⋆ ( t -δt ) .CC-BY · From the PDF
Figure 8 Asymptotic infidelity reachable using shots to sample the gradient. This plots illustrates the infidelity between the target and the ansatz state as the number of shots to sample the gradient increases. The values reported are the mean and the standard deviations of multiple runs made both with the Stochastic Gradient Descent and Adam as optimizers. The dashed lines are obtained fitting the function f = kn γ s . The grey dashdotted line indicates the expected behaviour n -1 s . In this simulation we considered N = 3 , d = 3 and M = 150 .
Figure 8 Asymptotic infidelity reachable using shots to sample the gradient. This plots illustrates the infidelity between the target and the ansatz state as the number of shots to sample the gradient increases. The values reported are the mean and the standard deviations of multiple runs made both with the Stochastic Gradient Descent and Adam as optimizers. The dashed lines are obtained fitting the function f = kn γ s . The grey dashdotted line indicates the expected behaviour n -1 s . In this simulation we considered N = 3 , d = 3 and M = 150 .CC-BY · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 58 references

Research works printed but not linked: 2

  1. Iordanis Kerenidis, Jonas Landman, Alessandro Luongo, and Anupam Prakash, ``q-means: A quantum algorithm for unsupervised machine learning'' Advances in Neural Information Processing Systems 32, 4134–4144 (2019).
  2. Jacov Frenkel ``Wave Mechanics: Advanced General Theory'' Oxford University Press (1934).

Cited by

See all 123

Metadata

Authors
Barison, S., Vicentini, F., & Carleo, G.
Affiliations
École Polytechnique Fédérale de Lausanne (CH)
Venue
Quantum
Published
2021-07-28
Volume
5
Pages
512
ISSN
2521-327X (ISSN-L)
OpenAlex
W3120410077
Cited by
110
References
58
Citations by year
2026: 6 · 2025: 19 · 2024: 24 · 2023: 30 · 2022: 21 · 2021: 10
FWCI
7.51
Type
journal article
Language
en
Open access
Locations
  • Quantum (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
  • arXiv (Cornell University) (cc-by)
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 › Mathematics › Numerical Analysis › Numerical Solvers for Ordinary Differential Equations
Keywords
variational quantum circuits, time-dependent variational principle, hybrid quantum-classical algorithms

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: An efficient quantum algorithm for the time evolution of parameterized circuits. https://app.cochat.ai/papers/10.22331/q-2021-07-28-512
The paper
Barison, S., Vicentini, F., & Carleo, G. (2021). An efficient quantum algorithm for the time evolution of parameterized circuits. Quantum. https://doi.org/10.22331/q-2021-07-28-512

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.