Speed limits on correlations in bipartite quantum systems
- URL: http://arxiv.org/abs/2207.05645v2
- Date: Fri, 26 May 2023 18:29:40 GMT
- Title: Speed limits on correlations in bipartite quantum systems
- Authors: Vivek Pandey, Divyansh Shrimali, Brij Mohan, Siddhartha Das, and Arun
Kumar Pati
- Abstract summary: We derive speed limits on correlations such as entanglement, Bell-CHSH correlation, and quantum mutual information of quantum systems evolving under dynamical processes.
Some of the speed limits we derived are actually attainable and hence these bounds can be considered to be tight.
- Score: 1.3854111346209868
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum speed limit is bound on the minimum time a quantum system requires to
evolve from an initial state to final state under a given dynamical process. It
sheds light on how fast a desired state transformation can take place which is
pertinent for design and control of quantum technologies. In this paper, we
derive speed limits on correlations such as entanglement, Bell-CHSH
correlation, and quantum mutual information of quantum systems evolving under
dynamical processes. Our main result is speed limit on an entanglement monotone
called negativity which holds for arbitrary dimensional bipartite quantum
systems and processes. Another entanglement monotone which we consider is the
concurrence. To illustrate efficacy of our speed limits, we analytically and
numerically compute the speed limits on the negativity, concurrence, and
Bell-CHSH correlation for various quantum processes of practical interest. We
are able to show that for practical examples we have considered, some of the
speed limits we derived are actually attainable and hence these bounds can be
considered to be tight.
Related papers
- QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Exact Quantum Speed Limits [0.0]
We derive exact quantum speed limits for the unitary dynamics of pure-state quantum system.
We estimate the evolution time for two- and higher-dimensional quantum systems.
Results will have a significant impact on our understanding of quantum physics.
arXiv Detail & Related papers (2023-05-05T20:38:54Z) - Quantum Speed Limit for Change of Basis [55.500409696028626]
We extend the notion of quantum speed limits to collections of quantum states.
For two-qubit systems, we show that the fastest transformation implements two Hadamards and a swap of the qubits simultaneously.
For qutrit systems the evolution time depends on the particular type of the unbiased basis.
arXiv Detail & Related papers (2022-12-23T14:10:13Z) - Quantum Speed Limit From Tighter Uncertainty Relation [0.0]
We prove a new quantum speed limit using the tighter uncertainty relations for pure quantum systems undergoing arbitrary unitary evolution.
We show that the MT bound is a special case of the tighter quantum speed limit derived here.
We illustrate the tighter speed limit for pure states with examples using random Hamiltonians and show that the new quantum speed limit outperforms the MT bound.
arXiv Detail & Related papers (2022-11-26T13:14:58Z) - Stronger Quantum Speed Limit [0.0]
We prove a stronger quantum speed limit (SQSL) for all quantum systems undergoing arbitrary unitary evolution.
The stronger quantum speed limit will have wide range of applications in quantum control, quantum computing and quantum information processing.
arXiv Detail & Related papers (2022-08-10T17:56:51Z) - Optimal bounds on the speed of subspace evolution [77.34726150561087]
In contrast to the basic Mandelstam-Tamm inequality, we are concerned with a subspace subject to the Schroedinger evolution.
By using the concept of maximal angle between subspaces we derive optimal bounds on the speed of such a subspace evolution.
These bounds may be viewed as further generalizations of the Mandelstam-Tamm inequality.
arXiv Detail & Related papers (2021-11-10T13:32:15Z) - Observing crossover between quantum speed limits [0.0]
Two well-known quantum speed limits are the Mandelstam-Tamm and the Margolus-Levitin bounds.
Here, we test concurrently both limits in a multi-level system by following the motion of a single atom in an optical trap.
Our data reveal two different regimes: one where the Mandelstam-Tamm limit constrains the evolution at all times, and a second where a crossover to the Margolus-Levitin limit is manifested at longer times.
arXiv Detail & Related papers (2021-04-12T17:01:47Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - Time-optimal quantum transformations with bounded bandwidth [0.0]
We derive sharp lower bounds, also known as quantum speed limits, for the time it takes to transform a quantum system into a state.
In a final section, we use the quantum speed limits to obtain upper bounds on the power with which energy can be extracted from quantum batteries.
arXiv Detail & Related papers (2020-11-24T08:42:08Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
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.