Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physica A Statistical Mechanics and its Applications

Quantum evolution of the localized state

V. V. Dodonov, Vladimir I. Man’ko, D. L. Ossipov

Published Oct 1, 1990• 13 citations
Publisher
DOI
10.1016/0378-4371(90)90271-s

Related papers

Spatial evolution of quantum mechanical states

Neil D. Christensen, J. Unger, Santiago Pinto +2 more

Annals of Physics•Dec 2, 2017•1 citation

Speed of quantum evolution of entangled two qubits states: Local vs. global evolution

Sergio Curilef, Claudia Zander, Angel Ricardo Plastino

There is a lower bound for the 'speed' of quantum evolution as measured by the time needed to reach an orthogonal state. We show that, for two-qubits systems, states saturating the quantum speed limit tend to exhibit a small amount of local evolution, as measured by the fidelity between the initial and final single qubit states after the time τ required by the composite system to reach an orthogonal state. Consequently, a trade-off between the speed of global evolution and the amount of local evolution seems to be at work.

Journal of Physics Conference Series•Nov 1, 2008•6 citations

Using Differential Evolution to avoid local minima in Variational Quantum Algorithms

Daniel Faílde, José Daniel Viqueira, Mariamo Mussa Juane +1 more

Variational Quantum Algorithms (VQAs) are among the most promising NISQ-era algorithms for harnessing quantum computing in diverse fields. However, the underlying optimization processes within these algorithms usually deal with local minima and barren plateau problems, preventing them from scaling efficiently. Our goal in this paper is to study alternative optimization methods that can avoid or reduce the effect of these problems. To this end, we propose to apply the Differential Evolution (DE) algorithm to VQAs optimizations. Our hypothesis is that DE is resilient to vanishing gradients and local minima for two main reasons: (1) it does not depend on gradients, and (2) its mutation and recombination schemes allow DE to continue evolving even in these cases. To demonstrate the performance of our approach, first, we use a robust local minima problem to compare state-of-the-art local optimizers (SLSQP, COBYLA, L-BFGS-B and SPSA) against DE using the Variational Quantum Eigensolver algorithm. Our results show that DE always outperforms local optimizers. In particular, in exact simulations of a 1D Ising chain with 14 qubits, DE achieves the ground state with a 100% success rate, while local optimizers only exhibit around 40%. We also show that combining DE with local optimizers increases the accuracy of the energy estimation once avoiding local minima. Finally, we demonstrate how our results can be extended to more complex problems by studying DE performance in a 1D Hubbard model.

arXiv:2303.12186•Scientific Reports•Sep 27, 2023•22 citations

Quantum Evolution

Archaeopress Publishing Ltd eBooks•May 20, 2021•0 citations

Simulating Quantum Systems Using Real Hilbert Spaces

Matthew McKague, Michele Mosca, Nicolas Gisin

We develop a means of simulating the evolution and measurement of a multipartite quantum state under discrete or continuous evolution using another quantum system with states and operators lying in a real Hilbert space. This extends previous results which were unable to simulate local evolution and measurements with local operators and was limited to discrete evolution. We also detail applications to Bell inequalities and self-testing of the quantum apparatus.

arXiv:0810.1923•Physical Review Letters•Jan 15, 2009•89 citations

Evolution of Quantum Systems

Bei Zeng, Xie Chen, D. L. Zhou +1 more

Quantum science and technology•Jan 1, 2019•0 citations
There is a lower bound for the 'speed' of quantum evolution as measured by the time needed to reach an orthogonal state. We show that, for two-qubits systems, states saturating the quantum speed limit tend to exhibit a small amount of local evolution, as measured by the fidelity between the initial and final single qubit states after the time τ required by the composite system to reach an orthogonal state. Consequently, a trade-off between the speed of global evolution and the amount of local evolution seems to be at work.
Variational Quantum Algorithms (VQAs) are among the most promising NISQ-era algorithms for harnessing quantum computing in diverse fields. However, the underlying optimization processes within these algorithms usually deal with local minima and barren plateau problems, preventing them from scaling efficiently. Our goal in this paper is to study alternative optimization methods that can avoid or reduce the effect of these problems. To this end, we propose to apply the Differential Evolution (DE) algorithm to VQAs optimizations. Our hypothesis is that DE is resilient to vanishing gradients and local minima for two main reasons: (1) it does not depend on gradients, and (2) its mutation and recombination schemes allow DE to continue evolving even in these cases. To demonstrate the performance of our approach, first, we use a robust local minima problem to compare state-of-the-art local optimizers (SLSQP, COBYLA, L-BFGS-B and SPSA) against DE using the Variational Quantum Eigensolver algorithm. Our results show that DE always outperforms local optimizers. In particular, in exact simulations of a 1D Ising chain with 14 qubits, DE achieves the ground state with a 100% success rate, while local optimizers only exhibit around 40%. We also show that combining DE with local optimizers increases the accuracy of the energy estimation once avoiding local minima. Finally, we demonstrate how our results can be extended to more complex problems by studying DE performance in a 1D Hubbard model.