arXiv:1803.10238 · Physical Review X

Quantum Chemistry Calculations on a Trapped-Ion Quantum Simulator

Cornelius Hempel, Christine Maier, Jonathan Romero, Jarrod McClean, Thomas Monz, Heng Shen, Petar Jurcevic, B. P. Lanyon, Peter Love, Ryan Babbush, Alán Aspuru‐Guzik, R. Blatt, Christian F. Roos

Published Jul 24, 2018• 607 citations

arXiv HTML PDF

Abstract

Quantum-classical hybrid algorithms are a promising approach for near-term practical applications of quantum computers. A new experiment demonstrates how a trapped-ion implementation of one such algorithm solves a quantum chemistry problem.

DOI: 10.1103/physrevx.8.031022

Related papers

From transistor to trapped-ion computers for quantum chemistry

Man‐Hong Yung, Jorge Casanova, Antonio Mezzacapo +4 more

Over the last few decades, quantum chemistry has progressed through the development of computational methods based on modern digital computers. However, these methods can hardly fulfill the exponentially-growing resource requirements when applied to large quantum systems. As pointed out by Feynman, this restriction is intrinsic to all computational models based on classical physics. Recently, the rapid advancement of trapped-ion technologies has opened new possibilities for quantum control and quantum simulations. Here, we present an efficient toolkit that exploits both the internal and motional degrees of freedom of trapped ions for solving problems in quantum chemistry, including molecular electronic structure, molecular dynamics, and vibronic coupling. We focus on applications that go beyond the capacity of classical computers, but may be realizable on state-of-the-art trapped-ion systems. These results allow us to envision a new paradigm of quantum chemistry that shifts from the current transistor to a near-future trapped-ion-based technology.

arXiv:1307.4326Scientific ReportsJan 7, 2014221 citations

Trapped ions tackle chemistry

Jelena Stajic

Quantum Computation Some of the most likely first applications of future quantum computers may be in quantum chemistry. Even with currently available quantum computers consisting of just a few qubits, it is possible to address certain simple problems, but most of the development has occurred in systems using superconducting qubits. Hempel et al. used up to four qubits encoded by trapped ions to calculate the ground-state energies of two simple molecules, H2 and LiH. They made use of a hybrid classical-quantum method called the variational quantum eigensolver, which relegates parts of the computation such as preprocessing and optimization to a classical computer. Phys. Rev. X 8 , 031022 (2018).

ScienceAug 30, 20180 citations

Quantum Computing Explained: A Beginner's Guide to the Future of Processing

Win Mathew John

Quantum computing represents a paradigmatic shift in computational methodology, leveraging quantum mechanical phenomena to process information in fundamentally different ways than classical computers. This paper examines the theoretical foundations, architectural implementations, and practical applications of quantum computing systems. Through analysis of current quantum computing platforms including superconducting, trapped-ion, and photonic implementations, we evaluate the technology's potential to solve computationally intractable problems in cryptography, optimization, and simulation. Key findings indicate that while quantum computers demonstrate quantum supremacy in specific domains, significant technical challenges including decoherence, error rates, and scalability limitations currently restrict practical applications. The analysis reveals that quantum computing's transformative potential lies in hybrid classical-quantum algorithms rather than complete replacement of classical systems. Current implementations show promise for near-term applications in quantum chemistry simulation and certain optimization problems, while fault-tolerant quantum computing remains a long-term objective requiring substantial technological advancement.

International Journal of Information Technology Research Studies (IJITRS)Oct 30, 20250 citations

Solving quantum chemistry problems on quantum computers

Klaus Liegener, O. Morsch, Guido Pupillo

One of the earliest applications that the new era of computing may be used for is the simulation of the quantum effects that drive chemical reactions.

Physics TodaySep 1, 20243 citations

Scaling Up a Trapped-Ion Quantum Computer

Sara Mouradian

Major technical improvements to a quantum computer based on trapped ions could bring a large-scale version closer to reality.

PhysicsDec 18, 20233 citations

Hybrid quantum-classical computation – From infrastructure to algorithms

Tobias Schmale

Quantum computers hold the potential of solving problems that are intractable using classical means. Yet, to date no quantum computer has actually solved a problem of general interest that could not have been solved otherwise. Bridging this gap from promised theoretical usefulness to practical relevance is an interdisciplinary challenge, requiring experimental progress, solutions of classical software challenges as well as advances in quantum algorithm design. It is these final two points in which this thesis aims to contribute. One of the most promising quantum computing architectures is based on trapping ions in surface-electrode ion-traps. In order to productively operate such trapped-ion quantum computers, we develop and benchmark a compiler that optimizes ion shuttling sequences in order to efficiently map abstract quantum circuits onto a physical trapped-ion chip. This is a necessary component of the infrastructure of a quantum computing setup, however it is alone not sufficient to execute arbitrary quantum algorithms. In particular, a very promising class of quantum algorithms are so-called hybrid quantum-classical algorithms which leverage the computational resources of both quantum and classical computers. To effectively implement such algorithms, a suitable software setup is necessary to allow for tight interplay between the two types of computers without wasting precious coherence time. To solve this challenge, we propose, implement and benchmark our setup for Interpreted Quantum-Classical Computations (IQCCs), demonstrating its feasibility for trapped-ion quantum computers. For the second part of this thesis we focus on the development of quantum algorithms that make use of this setup. As a first application, we investigate quantum simulations of gauge theories. Such theories are prevalent throughout modern physics and are characterized by local constraints that the dynamics are subject to. Errors in noisy simulations of such theories results in these constraints being violated and the simulations becoming unphysical. We show that this problem can be remedied by measuring gauge operators, decoding possible errors on a classical computer and actively correcting them, which reduces simulation errors. Additionally we interpret the scheme as a sympathetic cooling setup, which allows thermal control of the simulation. We finally turn to the task of preparing ground states of frustration-free Hamiltonians in quantum computers. Studying ground states of various systems is of paramount importance for solving optimization problems and understanding phenomena such as magnetism, superconductivity and superfluidity. We frame the ground-state preparation problem as an error correction problem, wherein energy is measured locally, measurements are decoded and corrections are applied to reduce the energy. In physically relevant examples we show up to exponentially improved runtimes over previous, similar algorithms and give a general run-time bound in terms of the Hamiltonian gap.

Jan 1, 20260 citations