Characterizing Optimal-speed unitary time evolution of pure and quasi-pure quantum states
- URL: http://arxiv.org/abs/2408.07794v1
- Date: Wed, 14 Aug 2024 20:10:39 GMT
- Title: Characterizing Optimal-speed unitary time evolution of pure and quasi-pure quantum states
- Authors: John A. Mora RodrÃguez, Brian Grajales, Marcelo Terra Cunha, Lino Grama,
- Abstract summary: We show that Hamiltonians generating optimal-speed time evolution are fully characterized by equigeodesic vectors of $SU(n)/textnormalS(textnormalU(1)times textnormalU(n-1))$.
We later extend that result to quasi-pure quantum states.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We present a characterization of the Hamiltonians that generate optimal-speed unitary time evolution and the associated dynamical trajectory, where the initial states are either pure states or quasi-pure quantum states. We construct the manifold of pure states as an orbit under the conjugation action of the Lie group $\SU(n)$ on the manifold of one-dimensional orthogonal projectors, obtaining an isometry with the flag manifold $\SU(n)/\textnormal{S}(\textnormal{U}(1)\times \textnormal{U}(n-1 ))$. From this construction, we show that Hamiltonians generating optimal-speed time evolution are fully characterized by equigeodesic vectors of $\SU(n)/\textnormal{S}(\textnormal{U}(1)\times \textnormal{U}(n-1))$. We later extend that result to quasi-pure quantum states.
Related papers
- Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
We present a quantum generalization of these tools through a generic bottleneck lemma.
This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.
Even with sublinear barriers, we use Feynman-Kac techniques to lift classical to quantum ones establishing tight lower bound $T_mathrmmix = 2Omega(nalpha)$.
arXiv Detail & Related papers (2024-11-06T22:51:27Z) - Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms [48.869199703062606]
A fundamental problem in quantum many-body physics is that of finding ground states of local Hamiltonians.
We introduce two approaches that achieve a constant sample complexity, independent of system size $n$, for learning ground state properties.
arXiv Detail & Related papers (2024-05-28T18:00:32Z) - Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
We show how to reduce the geometry of degenerate states to the non-abelian connection $A$.
We find independent invariants associated with each triple of subspaces.
Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
arXiv Detail & Related papers (2024-04-04T06:39:28Z) - Optimal quantum speed for mixed states [0.0]
We show that for an arbitrary $d$, the optimal state is represented by a $X$-state with an additional property of being symmetric with respect to the secondary diagonal.
Although the coherence of the states is responsible for the speed of evolution, only the coherence caused by some off-diagonal entries located on the secondary diagonal play a role in the fastest states.
arXiv Detail & Related papers (2023-05-13T20:54:29Z) - Average-case Speedup for Product Formulas [69.68937033275746]
Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems.
We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states.
Our results open doors to the study of quantum algorithms in the average case.
arXiv Detail & Related papers (2021-11-09T18:49:48Z) - Nearly-frustration-free ground state preparation [0.0]
Solving for quantum ground states is important for understanding the properties of quantum many-body systems.
Recent work has presented a nearly optimal scheme that prepares ground states on a quantum computer for completely generic Hamiltonians.
arXiv Detail & Related papers (2021-08-06T18:00:04Z) - Optimal parent Hamiltonians for time-dependent states [0.0]
Given a generic time-dependent many-body quantum state, we determine the associated parent Hamiltonian.
We find the optimal Hamiltonian once a set of realistic elementary interactions is defined.
arXiv Detail & Related papers (2021-05-21T07:54:55Z) - The underlying order induced by orthogonality and the quantum speed
limit [0.0]
A set of parameters $r_i$ provides the energy distribution of pure qutrits evolving towards a distinguishable state at a finite time.
A non-trivial interrelation between $tau$ and the energy spectrum is revealed.
The states determined by $r_i$ are likewise analyzed according to their quantum-speed limit.
arXiv Detail & Related papers (2021-04-05T07:23:57Z) - Quantum algorithm for time-dependent Hamiltonian simulation by
permutation expansion [6.338178373376447]
We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians.
We demonstrate that the cost of the algorithm is independent of the Hamiltonian's frequencies.
arXiv Detail & Related papers (2021-03-29T05:02:02Z) - Quantum speed limits for time evolution of a system subspace [77.34726150561087]
In the present work, we are concerned not with a single state but with a whole (possibly infinite-dimensional) subspace of the system states that are subject to the Schroedinger evolution.
We derive an optimal estimate on the speed of such a subspace evolution that may be viewed as a natural generalization of the Fleming bound.
arXiv Detail & Related papers (2020-11-05T12:13:18Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.