Quantum logic as reversible computing

• URL: http://arxiv.org/abs/2111.07431v1
• Date: Sun, 14 Nov 2021 19:51:09 GMT
• Title: Quantum logic as reversible computing
• Authors: Basil Evangelidis
• Abstract summary: reversible computer that cannot allow any ambiguity in backward steps of a calculation. The proposal aims at a higher kind of computer that would give the actual output of a computation together with the original input, with the absence of a minimum energy requirement.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The relation between entropy and information has great significance for computation. Based on the strict reversibility of the laws of microphysics, Landauer (1961), Bennett (1973), Priese (1976), Fredkin and Toffoli (1982), Feynman (1985) and others envisioned a reversible computer that cannot allow any ambiguity in backward steps of a calculation. It is this backward capacity that makes reversible computing radically different from ordinary, irreversible computing. The proposal aims at a higher kind of computer that would give the actual output of a computation together with the original input, with the absence of a minimum energy requirement. Hence, information retrievability and energy efficiency due to diminished heat dissipation are the exquisite tasks of quantum computer technology.

Related papers

• 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)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group [33.8590861326926]
  This paper is led by CERN, DESY and IBM and provides the status of high-energy physics quantum computations. We give examples for theoretical and experimental target benchmark applications, which can be addressed in the near future. Having the IBM 100 x 100 challenge in mind, where possible, we also provide resource estimates for the examples given using error mitigated quantum computing.
  arXiv  Detail & Related papers  (2023-07-06T18:01:02Z)
• A Universal Constraint on Computational Rates in Physical Systems [0.0]
  General proof is given for open quantum systems showing that a computer thermally coupled to its environment will necessarily dissipate entropy (and hence heat) Specifically, a lower bound is obtained that corresponds to the adiabatic regime, in which the amount of entropy dissipated per computational operation is proportional to the rate of computation.
  arXiv  Detail & Related papers  (2022-08-23T21:18:53Z)
• Third law of thermodynamics and the scaling of quantum computers [5.161531917413708]
  A fundamental assumption of quantum computing is to start each computation from a register of qubits in a pure state, i.e., at zero temperature. We argue how the existence of a small, but finite, effective temperature, which makes the initial state a mixed state, poses a real challenge to the fidelity constraints required for the scaling of quantum computers.
  arXiv  Detail & Related papers  (2022-03-17T18:04:35Z)
• Quantum Foundations of Classical Reversible Computing [0.0]
  reversible computing is capable of circumventing the thermodynamic limits to the energy efficiency of the conventional, non-reversible digital paradigm. We use the framework of Gorini-Kossakowski-Sudarshan-Lindblad dynamics (a.k.a Lindbladians) with multiple states, incorporating recent results from resource theory, full counting statistics, and reversible thermodynamics. We also outline a research plan for identifying the fundamental minimum energy dissipation of computing machines as a function of speed.
  arXiv  Detail & Related papers  (2021-04-30T19:53:47Z)
• Computing Free Energies with Fluctuation Relations on Quantum Computers [0.0]
  We present an algorithm utilizing a fluctuation relation known as the Jarzynski equality to approximate free energy differences of quantum systems on a quantum computer. We successfully demonstrate a proof-of-concept of our algorithm using the transverse field Ising model on a real quantum processor.
  arXiv  Detail & Related papers  (2021-03-17T18:14:19Z)
• Optimizing Electronic Structure Simulations on a Trapped-ion Quantum Computer using Problem Decomposition [41.760443413408915]
  We experimentally demonstrate an end-to-end pipeline that focuses on minimizing quantum resources while maintaining accuracy. Using density matrix embedding theory as a problem decomposition technique, and an ion-trap quantum computer, we simulate a ring of 10 hydrogen atoms without freezing any electrons. Our experimental results are an early demonstration of the potential for problem decomposition to accurately simulate large molecules on quantum hardware.
  arXiv  Detail & Related papers  (2021-02-14T01:47:52Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)
• Equal cost of computation for truth and falsity of experimental quantum propositions necessitates quantum parallel computing [0.0]
  equal cost of computation for truth and falsity of experimental quantum propositions cannot be achieved with classical computing. On the other hand, this equality might be realized with quantum parallel computing provided that the efficiency of such computing can be greater than 1.
  arXiv  Detail & Related papers  (2020-01-03T18:01:03Z)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)

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.