Solovay-Kitaev decomposition strategy for single-qubit channels

Single-Qubit Error Mitigation by Simulating Non-Markovian Dynamics

Quantum simulation is a powerful tool to study the properties of quantum systems. The dynamics of open quantum systems are often described by completely positive (CP) maps, for which several quantum simulation schemes exist. Such maps, however, represent only a subset of a larger class of maps: the general dynamical maps which are linear, Hermitian preserving, and trace preserving but not necessarily positivity preserving. Here we present a simulation scheme for these general dynamical maps, which occur when the underlying system-reservoir model undergoes entangling (and thus non-Markovian) dynamics. Such maps also arise as the inverse of CP maps, which are commonly used in error mitigation. We illustrate our simulation scheme on an IBM quantum processor, demonstrating its ability to recover the initial state of a Lindblad evolution. This paves the way for a novel form of quantum error mitigation. Our scheme only requires one ancilla qubit as an overhead and a small number of one and two qubit gates. Consequently, we expect it to be of practical use in near-term quantum devices.

Quantum Simulation of the Radical Pair Dynamics of the Avian Compass

The simulation of open quantum dynamics on quantum circuits has attracted wide interests recently with a variety of quantum algorithms developed and demonstrated. Among these, one particular design of a unitary-dilation-based quantum algorithm is capable of simulating general and complex physical systems. In this paper, we apply this quantum algorithm to simulating the dynamics of the radical pair mechanism in the avian compass. This application is demonstrated on the IBM QASM quantum simulator. This work is the first application of any quantum algorithm to simulating the radical pair mechanism in the avian compass, which not only demonstrates the generality of the quantum algorithm but also opens new opportunities for studying the avian compass with quantum computing devices.

Quantum algorithms for quantum dynamics

Among the many computational challenges faced across different disciplines, quantum-mechanical systems pose some of the hardest ones and offer a natural playground for the growing field of quantum technologies. In this Perspective, we discuss quantum algorithmic solutions for quantum dynamics, reporting on the latest developments and offering a viewpoint on their potential and current limitations. We present some of the most promising areas of application and identify possible research directions for the coming years.

Five-Spin Supramolecule for Simulating Quantum Decoherence of Bell States

We report a supramolecule that contains five spins of two different types and with, crucially, two different and predictable interaction energies between the spins. The supramolecule is characterized, and the interaction energies are demonstrated by electron paramagnetic resonance (EPR) spectroscopy. Based on the measured parameters, we propose experiments that would allow this designed supramolecule to be used to simulate quantum decoherence in maximally entangled Bell states that could be used in quantum teleportation.

Simulating Finite-Time Isothermal Processes with Superconducting Quantum Circuits

Finite-time isothermal processes are ubiquitous in quantum-heat-engine cycles, yet complicated due to the coexistence of the changing Hamiltonian and the interaction with the thermal bath. Such complexity prevents classical thermodynamic measurements of a performed work. In this paper, the isothermal process is decomposed into piecewise adiabatic and isochoric processes to measure the performed work as the internal energy change in adiabatic processes. The piecewise control scheme allows the direct simulation of the whole process on a universal quantum computer, which provides a new experimental platform to study quantum thermodynamics. We implement the simulation on ibmqx2 to show the 1/τ scaling of the extra work in finite-time isothermal processes.

Quantum Information and Algorithms for Correlated Quantum Matter

Discoveries in quantum materials, which are characterized by the strongly quantum-mechanical nature of electrons and atoms, have revealed exotic properties that arise from correlations. It is the promise of quantum materials for quantum information science superimposed with the potential of new computational quantum algorithms to discover new quantum materials that inspires this Review. We anticipate that quantum materials to be discovered and developed in the next years will transform the areas of quantum information processing including communication, storage, and computing. Simultaneously, efforts toward developing new quantum algorithmic approaches for quantum simulation and advanced calculation methods for many-body quantum systems enable major advances toward functional quantum materials and their deployment. The advent of quantum computing brings new possibilities for eliminating the exponential complexity that has stymied simulation of correlated quantum systems on high-performance classical computers. Here, we review new algorithms and computational approaches to predict and understand the behavior of correlated quantum matter. The strongly interdisciplinary nature of the topics covered necessitates a common language to integrate ideas from these fields. We aim to provide this common language while weaving together fields across electronic structure theory, quantum electrodynamics, algorithm design, and open quantum systems. Our Review is timely in presenting the state-of-the-art in the field toward algorithms with nonexponential complexity for correlated quantum matter with applications in grand-challenge problems. Looking to the future, at the intersection of quantum information science and algorithms for correlated quantum matter, we envision seminal advances in predicting many-body quantum states and describing excitonic quantum matter and large-scale entangled states, a better understanding of high-temperature superconductivity, and quantifying open quantum system dynamics.

A quantum algorithm for evolving open quantum dynamics on quantum computing devices

Designing quantum algorithms for simulating quantum systems has seen enormous progress, yet few studies have been done to develop quantum algorithms for open quantum dynamics despite its importance in modeling the system-environment interaction found in most realistic physical models. In this work we propose and demonstrate a general quantum algorithm to evolve open quantum dynamics on quantum computing devices. The Kraus operators governing the time evolution can be converted into unitary matrices with minimal dilation guaranteed by the Sz.-Nagy theorem. This allows the evolution of the initial state through unitary quantum gates, while using significantly less resource than required by the conventional Stinespring dilation. We demonstrate the algorithm on an amplitude damping channel using the IBM Qiskit quantum simulator and the IBM Q 5 Tenerife quantum device. The proposed algorithm does not require particular models of dynamics or decomposition of the quantum channel, and thus can be easily generalized to other open quantum dynamical models.

Experimental repetitive quantum channel simulation

Universal control of quantum systems is a major goal to be achieved for quantum information processing, which demands thorough understanding of fundamental quantum mechanics and promises applications of quantum technologies. So far, most studies concentrate on ideally isolated quantum systems governed by unitary evolutions, while practical quantum systems are open and described by quantum channels due to their inevitable coupling to environment. Here, we experimentally simulate arbitrary quantum channels for an open quantum system, i.e. a single photonic qubit in a superconducting quantum circuit. The arbitrary channel simulation is achieved with minimum resource of only one ancilla qubit and measurement-based adaptive control. By repetitively implementing the quantum channel simulation, we realize an arbitrary Liouvillian for a continuous evolution of an open quantum system for the first time. Our experiment provides not only a testbed for understanding quantum noise and decoherence, but also a powerful tool for full control of practical open quantum systems.

Geometrical Bounds on Irreversibility in Open Quantum Systems

The Clausius inequality has deep implications for reversibility and the arrow of time. Quantum theory is able to extend this result for closed systems by inspecting the trajectory of the density matrix on its manifold. Here we show that this approach can provide an upper and lower bound to the irreversible entropy production for open quantum systems as well. These provide insights on how the information on the initial state is forgotten through a thermalization process. Limits of the applicability of our bounds are discussed and demonstrated in a quantum photonic simulator.

Simulating and Optimising Quantum Thermometry Using Single Photons

A classical thermometer typically works by exchanging energy with the system being measured until it comes to equilibrium, at which point the readout is related to the final energy state of the thermometer. A recent paper noted that with a quantum thermometer consisting of a single spin/qubit, temperature discrimination is better achieved at finite times rather than once equilibration is essentially complete. Furthermore, preparing a qubit thermometer in a state with quantum coherence instead of an incoherent one improves its sensitivity to temperature differences. Implementing a recent proposal for efficiently emulating an arbitrary quantum channel, we use the quantum polarisation state of individual photons as models of "single-qubit thermometers" which evolve for a certain time in contact with a thermal bath. We investigate the optimal thermometer states for temperature discrimination, and the optimal interaction times, confirming that there is a broad regime where quantum coherence provides a significant improvement. We also discuss the more practical question of thermometers composed of a finite number of spins/qubits (greater than one), and characterize the performance of an adaptive protocol for making optimal use of all the qubits.