Energetic cost of Hamiltonian quantum gates

• URL: http://arxiv.org/abs/2102.05118v3
• Date: Fri, 12 Feb 2021 07:01:47 GMT
• Title: Energetic cost of Hamiltonian quantum gates
• Authors: Sebastian Deffner
• Abstract summary: We prove an inequality bounding the change of Shannon information encoded in the logical quantum states by quantifying the energetic cost of Hamiltonian gate operations. The utility of this bound is demonstrated by outlining how it can be applied to identify energetically optimal quantum gates in theory and experiment.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Landauer's principle laid the main foundation for the development of modern thermodynamics of information. However, in its original inception the principle relies on semiformal arguments and dissipative dynamics. Hence, if and how Landauer's principle applies to unitary quantum computing is less than obvious. Here, we prove an inequality bounding the change of Shannon information encoded in the logical quantum states by quantifying the energetic cost of Hamiltonian gate operations. The utility of this bound is demonstrated by outlining how it can be applied to identify energetically optimal quantum gates in theory and experiment. The analysis is concluded by discussing the energetic cost of quantum error correcting codes with non-interacting qubits, such as Shor's code.

Related papers

• An explicit tensor notation for quantum computing [0.0]
  This paper introduces a formalism that aims to describe the intricacies of quantum computation. The focus is on providing a comprehensive representation of quantum states for multiple qubits and the quantum gates that manipulate them.
  arXiv  Detail & Related papers  (2024-09-16T17:21:17Z)
• Generalized Quantum Stein's Lemma and Second Law of Quantum Resource Theories [47.02222405817297]
  A fundamental question in quantum information theory is whether an analogous second law can be formulated to characterize the convertibility of resources for quantum information processing by a single function. In 2008, a promising formulation was proposed, linking resource convertibility to the optimal performance of a variant of the quantum version of hypothesis testing. In 2023, a logical gap was found in the original proof of this lemma, casting doubt on the possibility of such a formulation of the second law.
  arXiv  Detail & Related papers  (2024-08-05T18:00:00Z)
• Quantum error mitigation for Fourier moment computation [49.1574468325115]
  This paper focuses on the computation of Fourier moments within the context of a nuclear effective field theory on superconducting quantum hardware. The study integrates echo verification and noise renormalization into Hadamard tests using control reversal gates. The analysis, conducted using noise models, reveals a significant reduction in noise strength by two orders of magnitude.
  arXiv  Detail & Related papers  (2024-01-23T19:10:24Z)
• On Some Quantum Correction to the Coulomb Potential in Generalized Uncertainty Principle Approach [0.0]
  We consider a modified Schr"odinger equation resulting from a generalized uncertainty principle. As the resulting equation cannot be solved by common exact approaches, we propose a Bethe ansatz approach.
  arXiv  Detail & Related papers  (2024-01-07T12:07:35Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• A simple formulation of no-cloning and no-hiding that admits efficient and robust verification [0.0]
  Incompatibility is a feature of quantum theory that sets it apart from classical theory. The no-hiding theorem is another such instance that arises in the context of the black-hole information paradox. We formulate both of these fundamental features of quantum theory in a single form that is amenable to efficient verification.
  arXiv  Detail & Related papers  (2023-03-05T12:48:11Z)
• Perturbation theory with quantum signal processing [0.0]
  We provide a quantum algorithm to obtain perturbative energies on quantum computers. The proposed algorithm uses quantum signal processing (QSP) to achieve this goal. This work is a first step towards explainable'' quantum simulation on fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2022-10-03T05:20:26Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Quantum Causal Inference in the Presence of Hidden Common Causes: an Entropic Approach [34.77250498401055]
  We put forth a new theoretical framework for merging quantum information science and causal inference by exploiting entropic principles. We apply our proposed framework to an experimentally relevant scenario of identifying message senders on quantum noisy links. This approach can lay the foundations of identifying originators of malicious activity on future multi-node quantum networks.
  arXiv  Detail & Related papers  (2021-04-24T22:45:50Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.