Classical Half-Adder using Trapped-ion Quantum Bits: Towards Energy-efficient Computation

• URL: http://arxiv.org/abs/2210.10470v2
• Date: Thu, 4 Apr 2024 06:51:22 GMT
• Title: Classical Half-Adder using Trapped-ion Quantum Bits: Towards Energy-efficient Computation
• Authors: Sagar Silva Pratapsi, Patrick H. Huber, Patrick Barthel, Sougato Bose, Christof Wunderlich, Yasser Omar,
• Abstract summary: Reversible computation has been proposed as a future paradigm for energy efficient computation. We provide a proof-of-principle of classical logical gates running on quantum technologies. We analyse the energy required to operate the logic gates, both theoretically and experimentally.
• Score: 0.43981305860983716
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Reversible computation has been proposed as a future paradigm for energy efficient computation, but so far few implementations have been realised in practice. Quantum circuits, running on quantum computers, are one construct known to be reversible. In this work, we provide a proof-of-principle of classical logical gates running on quantum technologies. In particular, we propose, and realise experimentally, Toffoli and Half-Adder circuits suitable for classical computation, using radiofrequency-controlled $^{171}$Yb$^+$ ions in a macroscopic linear Paul-trap as qubits. We analyse the energy required to operate the logic gates, both theoretically and experimentally, with a focus on the control energy. We identify bottlenecks and possible improvements in future platforms for energetically-efficient computation, e.g., trap chips with integrated antennas and cavity QED. Our experimentally verified energetic model also fills a gap in the literature of the energetics of quantum information, and outlines the path for its detailed study, as well as its potential applications to classical computing.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Bridging Classical and Quantum: Group-Theoretic Approach to Quantum Circuit Simulation [0.0]
  Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves exponential speedups (polynomial runtime) over existing simulators. The findings may have implications for quantum algorithm design, error correction, and the development of more efficient quantum simulators.
  arXiv  Detail & Related papers  (2024-07-28T20:02:21Z)
• Towards Energetic Quantum Advantage in Trapped-Ion Quantum Computation [0.0]
  In this work, one implementation of the quantum Fourier transform (QFT) algorithm in a trapped ion setup was studied. The main focus was to obtain a theoretical characterization of the energetic costs of quantum computation. A potential scaling of the energetic costs was argued and used to find a possible threshold for an energetic quantum advantage against state-of-the-art classical supercomputers.
  arXiv  Detail & Related papers  (2024-04-17T17:14:53Z)
• Reservoir Computing Using Measurement-Controlled Quantum Dynamics [0.0]
  We introduce a quantum RC system that employs the dynamics of a probed atom in a cavity. The proposed quantum reservoir can make fast and reliable forecasts using a small number of artificial neurons.
  arXiv  Detail & Related papers  (2024-03-01T22:59:41Z)
• Quantum Simulation of Dissipative Energy Transfer via Noisy Quantum Computer [0.40964539027092917]
  We propose a practical approach to simulate the dynamics of an open quantum system on a noisy computer. Our method leverages gate noises on the IBM-Q real device, enabling us to perform calculations using only two qubits. In the last, to deal with the increasing depth of quantum circuits when doing Trotter expansion, we introduced the transfer tensor method(TTM) to extend our short-term dynamics simulation.
  arXiv  Detail & Related papers  (2023-12-03T13:56:41Z)
• 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)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Estimating Phosphorescent Emission Energies in Ir(III) Complexes using Large-Scale Quantum Computing Simulations [0.0]
  We apply the iterative qubit coupled cluster (iQCC) method on classical hardware to the calculation of the transition energies in nine phosphorescent iridium complexes. Our simulations would require a gate-based quantum computer with a minimum of 72 fully-connected and error-corrected logical qubits. The iQCC quantum method is found to match the accuracy of the fine-tuned DFT functionals, has a better Pearson correlation coefficient, and still has considerable potential for systematic improvement.
  arXiv  Detail & Related papers  (2021-11-07T20:02:10Z)
• The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning [84.33745072274942]
  We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles. On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
  arXiv  Detail & Related papers  (2021-03-08T17:24:29Z)

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.