Quantum simulation

Image: Matthew Broome / EQuS

Quantum computing for chemistry

Chemistry and materials science are widely expected to be the first real-world problems where quantum computers will outperform conventional ones.

Predicting chemical and physical properties such as molecular energies or reaction rates becomes harder as the system grows in size, sometimes exponentially fast. The fundamental obstacle is the difficulty of representing quantum effects such as entanglement on classical computers. As a result, the most accurate chemical techniques are restricted to small systems.

Quantum computers promise to solve the problem of chemical simulation in a natural way, by using a controllable quantum machine to mimic the unknown process. We have developed a suite of quantum methods that could dramatically accelerate the simulation of chemical processes,8 including the simulation of chemical reactions2 and the determination of properties like the dipole moment.5 We have collaborated with experimentalists to implement these algorithms—including the first quantum-computer simulation of molecular energies6—and we continue to work on pushing the limits of quantum technology.

Analog quantum simulators

Quantum simulators are devices that are purpose built to simulate a target quantum system without needing to be as powerful or as versatile as universal quantum computers. Because they are easier to build than full quantum computers, they promise to be among the first quantum technologies to be practically useful.

We have contributed to the development of quantum simulators that were the first to experimentally demonstrate several phenomena that were otherwise too difficult to study in the laboratory, including partially coherent quantum walks,7 topologically protected bound states,9 and environment-assisted quantum transport17 (which we previously described in the context of photosynthetic energy transport).

We are currently developing next-generation analog quantum simulators for simulating chemical processes—stay tuned or come join us!

Related papers

“Enhancing coherent transport in a photonic network using controllable decoherence”
Devon N. Biggerstaff, René Heilmann, Aidan A. Zecevik, Markus Gräfe, Matthew A. Broome, Alessandro Fedrizzi, Stefan Nolte, Alexander Szameit, Andrew G. White, and Ivan Kassal
Nature Commun. 7, 11282 (2016).
Abstract PDF BibTeX
Transport phenomena on a quantum scale appear in a variety of systems, ranging from photosynthetic complexes to engineered quantum devices. It has been predicted that the efficiency of coherent transport can be enhanced through dynamic interaction between the system and a noisy environment. We report an experimental simulation of environment-assisted coherent transport, using an engineered network of laser-written waveguides, with relative energies and inter-waveguide couplings tailored to yield the desired Hamiltonian. Controllable-strength decoherence is simulated by broadening the bandwidth of the input illumination, yielding a significant increase in transport efficiency relative to the narrowband case. We show integrated optics to be suitable for simulating specific target Hamiltonians as well as open quantum systems with controllable loss and decoherence.
“A two-qubit photonic quantum processor and its application to solving systems of linear equations”
Stefanie Barz, Ivan Kassal, Martin Ringbauer, Yannick Ole Lipp, Borivoje Dakić, Alán Aspuru-Guzik, and Philip Walther
Sci. Rep. 4, 6115 (2014).
Abstract PDF BibTeX
Large-scale quantum computers will require the ability to apply long sequences of entangling gates to many qubits. In a photonic architecture, where single-qubit gates can be performed easily and precisely, the application of consecutive two-qubit entangling gates has been a significant obstacle. Here, we demonstrate a two-qubit photonic quantum processor that implements two consecutive CNOT gates on the same pair of polarisation-encoded qubits. To demonstrate the flexibility of our system, we implement various instances of the quantum algorithm for solving of systems of linear equations.
“Observation of topologically protected bound states in photonic quantum walks”
Takuya Kitagawa, Matthew A. Broome, Alessandro Fedrizzi, Mark S. Rudner, Erez Berg, Ivan Kassal, Alán Aspuru-Guzik, Eugene Demler, and Andrew G. White
Nature Commun. 3, 882 (2012).
Abstract PDF BibTeX
Topological phases exhibit some of the most striking phenomena in modern physics. Much of the rich behaviour of quantum Hall systems, topological insulators, and topological superconductors can be traced to the existence of robust bound states at interfaces between different topological phases. This robustness has applications in metrology and holds promise for future uses in quantum computing. Engineered quantum systems—notably in photonics, where wavefunctions can be observed directly—provide versatile platforms for creating and probing a variety of topological phases. Here we use photonic quantum walks to observe bound states between systems with different bulk topological properties and demonstrate their robustness to perturbations—a signature of topological protection. Although such bound states are usually discussed for static (time-independent) systems, here we demonstrate their existence in an explicitly time-dependent situation. Moreover, we discover a new phenomenon: a topologically protected pair of bound states unique to periodically driven systems.
“Simulating chemistry using quantum computers”
Ivan Kassal, James D. Whitfield, Alejandro Perdomo-Ortiz, Man-Hong Yung, and Alán Aspuru-Guzik
Annu. Rev. Phys. Chem. 62, 185 (2011).
Abstract PDF BibTeX
The difficulty of simulating quantum systems, well known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems. We describe algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks. Although theory is still ahead of experiment, we outline recent advances that have led to the first chemical calculations on small quantum information processors.
“Discrete single-photon quantum walks with tunable decoherence”
Matthew A. Broome, Alessandro Fedrizzi, Benjamin P. Lanyon, Ivan Kassal, Alán Aspuru-Guzik, and Andrew G. White
Phys. Rev. Lett. 104, 153602 (2010).
Abstract PDF BibTeX
Quantum walks have a host of applications, ranging from quantum computing to the simulation of biological systems. We present an intrinsically stable, deterministic implementation of discrete quantum walks with single photons in space. The number of optical elements required scales linearly with the number of steps. We measure walks with up to 6 steps and explore the quantum-to-classical transition by introducing tunable decoherence. Finally, we also investigate the effect of absorbing boundaries and show that decoherence significantly affects the probability of absorption.
“Towards quantum chemistry on a quantum computer”
Benjamin P. Lanyon, James D. Whitfield, Geoff G. Gillet, Michael E. Goggin, Marcelo P. Almeida, Ivan Kassal, Jacob D. Biamonte, Masoud Mohseni, Ben J. Powell, Marco Barbieri, Alán Aspuru-Guzik, and Andrew G. White
Nature Chem. 2, 106 (2010).
Abstract PDF BibTeX
Exact first-principles calculations of molecular properties are currently intractable because their computational cost grows exponentially with both the number of atoms and basis set size. A solution is to move to a radically different model of computing by building a quantum computer, which is a device that uses quantum systems themselves to store and process data. Here we report the application of the latest photonic quantum computer technology to calculate properties of the smallest molecular system: the hydrogen molecule in a minimal basis. We calculate the complete energy spectrum to 20 bits of precision and discuss how the technique can be expanded to solve large-scale chemical problems that lie beyond the reach of modern supercomputers. These results represent an early practical step toward a powerful tool with a broad range of quantum-chemical applications.
“Quantum algorithm for molecular properties and geometry optimization”
Ivan Kassal and Alán Aspuru-Guzik
J. Chem. Phys. 131, 224102 (2009).
Abstract PDF BibTeX
Quantum computers, if available, could substantially accelerate quantum simulations. We extend this result to show that the computation of molecular properties (energy derivatives) could also be sped up using quantum computers. We provide a quantum algorithm for the numerical evaluation of molecular properties, whose time cost is a constant multiple of the time needed to compute the molecular energy, regardless of the size of the system. Molecular properties computed with the proposed approach could also be used for the optimization of molecular geometries or other properties. For that purpose, we discuss the benefits of quantum techniques for Newton’s method and Householder methods. Finally, global minima for the proposed optimizations can be found using the quantum basin hopper algorithm, which offers an additional quadratic reduction in cost over classical multi-start techniques.
“Preparation of many-body states for quantum simulation”
Nicholas J. Ward, Ivan Kassal, and Alán Aspuru-Guzik
J. Chem. Phys. 130, 194105 (2009).
Abstract PDF BibTeX
While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum states on a lattice in real space. In particular, the present algorithm is able to prepare general pure and mixed many-particle states of any number of particles. It relies on a procedure for converting from a second-quantized state to its first-quantized counterpart. The algorithm is efficient in that it operates in time that is polynomial in all the essential descriptors of the system, the number of particles, the resolution of the lattice, and the inverse of the maximum final error. This scaling holds under the assumption that the wave function to be prepared is bounded or its indefinite integral is known and that the Fock operator of the system is efficiently simulatable.
“Polynomial-time quantum algorithm for the simulation of chemical dynamics”
Ivan Kassal, Stephen Jordan, Peter Love, Masoud Mohseni, and Alán Aspuru-Guzik
Proc. Natl. Acad. Sci. 105, 18681 (2008).
Abstract PDF BibTeX
The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can be applied only to small systems. By contrast, we demonstrate that quantum computers could exactly simulate chemical reactions in polynomial time. Our algorithm uses the split-operator approach and explicitly simulates all electron-nuclear and interelectronic interactions in quadratic time. Surprisingly, this treatment is not only more accurate than the Born–Oppenheimer approximation but faster and more efficient as well, for all reactions with more than about four atoms. This is the case even though the entire electronic wave function is propagated on a grid with appropriately short time steps. Although the preparation and measurement of arbitrary states on a quantum computer is inefficient, here we demonstrate how to prepare states of chemical interest efficiently. We also show how to efficiently obtain chemically relevant observables, such as state-to-state transition probabilities and thermal reaction rates. Quantum computers using these techniques could outperform current classical computers with 100 qubits.