Quantum speed limit for the creation and decay of quantum correlations
- URL: http://arxiv.org/abs/2205.11882v1
- Date: Tue, 24 May 2022 08:00:40 GMT
- Title: Quantum speed limit for the creation and decay of quantum correlations
- Authors: K.G Paulson and Subhashish Banerjee
- Abstract summary: We derive Margolus-Levitin and Mandelstamm-Tamm type bound on the quantum speed limit time for the creation and decay of quantum correlations.
We consider entanglement and quantum discord measures of quantum correlations, quantified using the Bures distance-based measure.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We derive Margolus-Levitin and Mandelstamm-Tamm type bound on the quantum
speed limit time for the creation and decay of quantum correlations by an
amount in a quantum system evolving under the influence of its ambient
environment. The minimum distance of a non-classical state from an appropriate
set of classical states is a legitimate measure of the quantumness of the
state. We consider entanglement and quantum discord measures of quantum
correlations, quantified using the Bures distance-based measure. To demonstrate
the impact of quantum noise on this speed limit time for quantum correlations,
we estimate the quantum speed limit time for the creation and decay of quantum
correlations for a two-qubit system under modified OUN dephasing and collective
two-qubit decoherence channels.
Related papers
- A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - Amplification of quantum transfer and quantum ratchet [56.47577824219207]
We study a model of amplification of quantum transfer and making it directed which we call the quantum ratchet model.
The ratchet effect is achieved in the quantum control model with dissipation and sink, where the Hamiltonian depends on vibrations in the energy difference synchronized with transitions between energy levels.
Amplitude and frequency of the oscillating vibron together with the dephasing rate are the parameters of the quantum ratchet which determine its efficiency.
arXiv Detail & Related papers (2023-12-31T14:04:43Z) - 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) - Affinity-based geometric discord and quantum speed limits of its
creation and decay [0.0]
We define a faithful quantifiers of bipartite quantum correlation, namely geometric version of quantum discord using affinity based metric.
We derive Margolus-Levitin (ML) and Mandelstamm-Tamm (MT) bounds for the quantum speed limit time for the creation and decay of quantum correlation.
arXiv Detail & Related papers (2022-11-27T21:33:30Z) - Entanglement-assisted quantum speedup: Beating local quantum speed limits [0.0]
Research in quantum information science aims to surpass the scaling limitations of classical information processing.
Speed limits in interacting quantum systems are derived by comparing the rates of change in actual quantum dynamics.
Proposed speed limits provide a tight bound on quantum speed advantage, including a quantum gain that can scale exponentially with the system's size.
arXiv Detail & Related papers (2022-11-27T17:38:57Z) - The effect of quantum memory on quantum speed limit time for
CP-(in)divisible channels [0.0]
Quantum speed limit time defines the limit on the minimum time required for a quantum system to evolve between two states.
We show that the presence of quantum memory can speed up quantum evolution.
arXiv Detail & Related papers (2021-07-06T04:48:08Z) - Time scaling and quantum speed limit in non-Hermitian Hamiltonians [0.0]
We report on a time scaling technique to enhance the performances of quantum protocols in non-Hermitian systems.
We derive the quantum speed limit in a system governed by a non-Hermitian Hamiltonian.
arXiv Detail & Related papers (2021-06-09T15:56: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) - 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) - Quantum time dilation: A new test of relativistic quantum theory [91.3755431537592]
A novel quantum time dilation effect is shown to arise when a clock moves in a quantum superposition of two relativistic velocities.
This effect is argued to be measurable using existing atomic interferometry techniques, potentially offering a new test of relativistic quantum theory.
arXiv Detail & Related papers (2020-04-22T19:26:53Z) - Hierarchy of quantum correlations under non-Markovian dynamics [0.0]
We investigate the dynamics of quantum correlations (QC) under the effects of reservoir memory.
QC is a resource for quantum information and computation tasks.
arXiv Detail & Related papers (2020-04-21T22:19:44Z)
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.