Strong Converse Exponent of Quantum Dichotomies
- URL: http://arxiv.org/abs/2410.12576v2
- Date: Wed, 02 Apr 2025 13:25:40 GMT
- Title: Strong Converse Exponent of Quantum Dichotomies
- Authors: Mario Berta, Yongsheng Yao,
- Abstract summary: We study the large-deviation behavior of quantum dichotomies and determine the exact strong converse exponent based on the purified distance.<n>This is the first time to establish the exact high-error large-deviation analysis for this task in fully quantum setting.
- Score: 5.371337604556312
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The quantum dichotomies problem asks at what rate one pair of quantum states can be approximately mapped into another pair of quantum states. In the many copy limit and for vanishing error, the optimal rate is known to be given by the ratio of the respective quantum relative distances. Here, we study the large-deviation behavior of quantum dichotomies and determine the exact strong converse exponent based on the purified distance. This is the first time to establish the exact high-error large-deviation analysis for this task in fully quantum setting.
Related papers
- Critical Scaling of the Quantum Wasserstein Distance [0.0]
We show that the quantum Wasserstein distance between two ground states of a quantum critical system exhibits critical scaling.
Our results have implications for learning of ground states of quantum critical phases of matter.
arXiv Detail & Related papers (2025-04-03T15:47:56Z) - The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.
Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
arXiv Detail & Related papers (2024-10-18T13:59:50Z) - Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
Storing quantum information requires battling quantum decoherence, which results in a loss of information over time.
To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another.
We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
arXiv Detail & Related papers (2024-07-08T12:46:08Z) - A vertical gate-defined double quantum dot in a strained germanium
double quantum well [48.7576911714538]
Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation.
We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well.
We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
arXiv Detail & Related papers (2023-05-23T13:42:36Z) - Approximation of the Nearest Classical-Classical State to a Quantum
State [0.0]
A revolutionary step in computation is driven by quantumness or quantum correlations, which are permanent in entanglements but often in separable states.
The exact quantification of quantumness is an NP-hard problem; thus, we consider alternative approaches to approximate it.
We show that the objective value decreases along the flow by proofs and numerical results.
arXiv Detail & Related papers (2023-01-23T08:26:17Z) - Quantum Wasserstein distance based on an optimization over separable
states [0.0]
We find that the self-distance is related to the quantum Fisher information.
We present a transport map corresponding to an optimal bipartite separable state.
arXiv Detail & Related papers (2022-09-20T18:01:33Z) - Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
We investigate properties of entanglement and its role for quantum communication.
For transformations between bipartite pure states, we prove the existence of a universal catalyst.
We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
arXiv Detail & Related papers (2022-02-10T18:36:25Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - One-shot quantum state redistribution and quantum Markov chains [15.66921140731163]
We revisit the task of quantum state redistribution in the one-shot setting.
We design a protocol for this task with communication cost in terms of a measure of distance from quantum Markov chains.
Our result is the first to operationally connect quantum state redistribution and quantum chains.
arXiv Detail & Related papers (2021-04-18T07:34:22Z) - Quantifying the difference between many-body quantum states [0.0]
We introduce the weighted distances, a new class of information-theoretic measures.
They quantify how hard it is to discriminate between two quantum states of many particles.
They can be used to evaluate both the theoretical and the experimental performances of complex quantum devices.
arXiv Detail & Related papers (2020-12-10T12:10:09Z) - Universal quantum computation and quantum error correction with
ultracold atomic mixtures [47.187609203210705]
We propose a mixture of two ultracold atomic species as a platform for universal quantum computation with long-range entangling gates.
One atomic species realizes localized collective spins of tunable length, which form the fundamental unit of information.
We discuss a finite-dimensional version of the Gottesman-Kitaev-Preskill code to protect quantum information encoded in the collective spins.
arXiv Detail & Related papers (2020-10-29T20:17:14Z) - The Quantum Wasserstein Distance of Order 1 [16.029406401970167]
We propose a generalization of the Wasserstein distance of order 1 to the quantum states of $n$ qudits.
The proposed distance is invariant with respect to permutations of the qudits and unitary operations acting on one qudit.
We also propose a generalization of the Lipschitz constant to quantum observables.
arXiv Detail & Related papers (2020-09-09T18:00:01Z) - Pure State Tomography with Fourier Transformation [3.469001874498102]
Two adaptive protocols are proposed, with their respective quantum circuits.
Experiments on the IBM 5-qubit quantum computer, as well as numerical investigations, demonstrate the feasibility of the proposed protocols.
arXiv Detail & Related papers (2020-08-20T17:13:09Z)
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.