Universal fidelity-dissipation relations in quantum gates
- URL: http://arxiv.org/abs/2311.15762v1
- Date: Mon, 27 Nov 2023 12:31:52 GMT
- Title: Universal fidelity-dissipation relations in quantum gates
- Authors: Tan Van Vu and Tomotaka Kuwahara and Keiji Saito
- Abstract summary: Quantum gates in practice are generally affected by dissipative environments, which can significantly reduce their fidelity.
In this Letter, we elucidate universal relations between the average fidelity of generic quantum gates and the dissipation that occurs during the computing processes.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Accurate quantum computing relies on the precision of quantum gates. However,
quantum gates in practice are generally affected by dissipative environments,
which can significantly reduce their fidelity. In this Letter, we elucidate
universal relations between the average fidelity of generic quantum gates and
the dissipation that occurs during the computing processes. Considering
scenarios in which a quantum gate is subject to Markovian environments, we
rigorously derive fidelity-dissipation relations that universally hold for
arbitrary operational times. Intriguingly, when the quantum gate undergoes
thermal relaxation, the result can be used as a valuable tool for estimating
dissipation through experimentally measurable fidelity, without requiring
detailed knowledge of the dissipative structure. For the case of arbitrary
environments, we uncover a tradeoff relation between the average fidelity and
energy dissipation, implying that these quantities cannot be large
simultaneously. Our results unveil the computational limitations imposed by
thermodynamics, shedding light on the profound connection between
thermodynamics and quantum computing.
Related papers
- Quantum Computer-Based Verification of Quantum Thermodynamic Uncertainty Relation [1.6574413179773757]
Quantum thermodynamic uncertainty relations establish the fundamental trade-off between precision and thermodynamic costs.
We present an approach that utilizes a noisy quantum computer for verifying a general quantum thermodynamic uncertainty relation.
This study highlights the potential and limitations of noisy quantum computers for demonstrating quantum thermodynamic trade-offs.
arXiv Detail & Related papers (2024-02-29T15:55:29Z) - 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) - Impact of decoherence on the fidelity of quantum gates leaving the
computational subspace [0.0]
We show the average gate fidelity of a general multiqubit operation in terms of the dissipative rates and the corresponding Lindblad jump operators.
These results are useful for understanding the error budgets of quantum gates while scaling up quantum computers.
arXiv Detail & Related papers (2023-02-27T15:31:52Z) - Universal trade-off structure between symmetry, irreversibility, and
quantum coherence in quantum processes [0.0]
We show that under a global symmetry, any attempt to induce local dynamics that change the conserved quantity will cause inevitable irreversibility.
In the context of thermodynamics, we derive a trade-off relation between entropy production and quantum coherence.
As an application to quantum information processing, we provide a lower bound on the coherence cost to implement an arbitrary quantum channel.
arXiv Detail & Related papers (2022-06-22T13:49:40Z) - 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) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Finite-Time Quantum Landauer Principle and Quantum Coherence [0.0]
We show that the dissipated heat is lower-bounded by the conventional Landauer cost.
We derive a lower bound for heat dissipation in terms of quantum coherence.
arXiv Detail & Related papers (2021-06-10T13:44:31Z) - 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) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Eliminating Intermediate Measurements in Space-Bounded Quantum
Computation [0.0]
We show that it is possible to defer measurements to the end of a quantum computation without increasing the number of ancillary qubits.
A key component of our approach involves showing that the well-conditioned versions of many standard linear-algebraic problems may be solved by a quantum computer in less space than seems possible by a classical computer.
arXiv Detail & Related papers (2020-06-05T16:05:49Z) - 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.