Quantifying the difference between many-body quantum states
- URL: http://arxiv.org/abs/2012.05619v5
- Date: Wed, 2 Jun 2021 09:28:47 GMT
- Title: Quantifying the difference between many-body quantum states
- Authors: Davide Girolami, Fabio Anz\`a
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The quantum state overlap is the textbook measure of the difference between
two quantum states. Yet, it is inadequate to compare the complex configurations
of many-body systems. The problem is inherited by the widely employed quantum
state fidelity and related distances. We introduce the weighted distances, a
new class of information-theoretic measures that overcome these limitations.
They quantify how hard it is to discriminate between two quantum states of many
particles, factoring in the structure of the required measurement apparatus.
Therefore, they can be used to evaluate both the theoretical and the
experimental performances of complex quantum devices. We also show that the
newly defined "weighted Bures length" between the input and output states of a
quantum process is a lower bound to the experimental cost of the
transformation. The result uncovers an exact quantum limit to our ability to
convert physical resources into computational ones.
Related papers
- What is computable and non-computable in the quantum domain: 7 statements and 3 conjectures [0.7892577704654171]
There is no universal approach that helps to define a scope of problems that quantum computers are able to speed up.
On the one hand, the class of quantum states that is of interest for quantum computing should be complex.
On the other hand, such quantum states should be reachable on a practical quantum computer.
arXiv Detail & Related papers (2024-03-25T15:47:35Z) - Taming Quantum Time Complexity [50.10645865330582]
We show how to achieve both exactness and thriftiness in the setting of time complexity.
We employ a novel approach to the design of quantum algorithms based on what we call transducers.
arXiv Detail & Related papers (2023-11-27T14:45:19Z) - Simulating 2D lattice gauge theories on a qudit quantum computer [2.2246996966725305]
We present a quantum computation of the properties of the basic building block of two-dimensional lattice quantum electrodynamics.
This is made possible by the use of a trapped-ion qudit quantum processor.
Qudits are ideally suited for describing gauge fields, which are naturally high-dimensional.
arXiv Detail & Related papers (2023-10-18T17:06:35Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Wasserstein Complexity of Quantum Circuits [10.79258896719392]
Given a unitary transformation, what is the size of the smallest quantum circuit that implements it?
This quantity, known as the quantum circuit complexity, is a fundamental property of quantum evolutions.
We show that our new measure also provides a lower bound for the experimental cost of implementing quantum circuits.
arXiv Detail & Related papers (2022-08-12T14:44:13Z) - 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) - 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) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Demonstration of quantum brachistochrones between distant states of an
atom [0.0]
We show fast coherent transport of an atomic wave packet over a distance of 15 times its size.
Results shed light upon a fundamental limit of quantum state dynamics and are expected to find relevant applications in quantum sensing and quantum computing.
arXiv Detail & Related papers (2020-09-04T15:00:11Z) - 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) - Operational Resource Theory of Imaginarity [48.7576911714538]
We show that quantum states are easier to create and manipulate if they only have real elements.
As an application, we show that imaginarity plays a crucial role for state discrimination.
arXiv Detail & Related papers (2020-07-29T14:03:38Z)
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.