Related papers: Universal quantum processors in spin systems via r…
Although a universal quantum computer is still far from reach, the tremendous advances in controllable quantum devices, in particular with solid-state systems, make it possible to physically implement "quantum simulators". Quantum…
Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations.…
The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have…
In this article, we introduce a framework for Hamiltonian tomography of multi-qubit systems with random noise. We adopt the quantum quench protocol to reconstruct a many-body Hamiltonian by local measurements that are distorted by random…
We review a recent theoretical proposal for a universal quantum computing platform based on tunable nonlinear electromechanical nano-oscillators, in which qubits are encoded in the anharmonic vibrational modes of mechanical resonators…
A universal family of Hamiltonians can be used to simulate any local Hamiltonian by encoding its full spectrum as the low-energy subspace of a Hamiltonian from the family. Many spin-lattice model Hamiltonians -- such as Heisenberg or XY…
Global control strategies for arrays of qubits are a promising pathway to scalable quantum computing. A continuous-wave global field provides decoupling of the qubits from background noise. However, this approach is limited by variability…
The ability of pulse-shaping devices to generate accurately quantum optimal control is a strong limitation to the development of quantum technologies. We propose and demonstrate a systematic procedure to design robust digital control…
We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising…
Classical simulators play a major role in the development and benchmark of quantum algorithms and practically any software framework for quantum computation provides the option of running the algorithms on simulators. However, the…
The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wavefunctions that are relevant in the behavior of the system under study. Hamiltonian symmetries are an important…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly…
We propose a method for quantum computation which uses control of spin-orbit coupling in a linear array of single electron quantum dots. Quantum gates are carried out by pulsing the exchange interaction between neighboring electron spins,…
Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the…
The Hamiltonian control of n qubits requires precision control of both the strength and timing of interactions. Compensation pulses relax the precision requirements by reducing unknown but systematic errors. Using composite pulse techniques…
We experimentally assess the suitability of transmon qubits with fixed frequencies and fixed interactions for the realization of analogue quantum simulations of spin systems. We test a set of necessary criteria for this goal on a commercial…
We propose dynamical control schemes for Hamiltonian simulation in many-body quantum systems that avoid instantaneous control operations and rely solely on realistic bounded-strength control Hamiltonians. Each simulation protocol consists…
We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…
Simulating large-scale coupled-oscillator systems presents substantial computational challenges for classical algorithms, particularly when pursuing first-principles analyses in the thermodynamic limit. Motivated by the quantum algorithm…
We show that it is possible to uniquely reconstruct a generic many-body local Hamiltonian from a single pair of initial and final states related by time evolution with the Hamiltonian. We then propose a practical version of the protocol…