Related papers: Fast Universal Quantum Computation with Railroad-s…
A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…
Quantum gates, which are the essential building blocks of quantum computers, are very fragile. Thus, to realize robust quantum gates with high fidelity is the ultimate goal of quantum manipulation. Here, we propose a nonadiabatic geometric…
We study the quantum computational power of a generic class of anisotropic solid state Hamiltonians. A universal set of encoded logic operations are found which do away with difficult-to-implement single-qubit gates in a number of quantum…
Quantum computers promise dramatic speed ups for many computational tasks. For large-scale quantum computation however, the inevitable coupling of physical qubits to the noisy environment imposes a major challenge for a real-life…
Quantum computers allow to solve efficiently certain problems that are intractable for classical computers. For the realization of a quantum computer, a qubit design as the basic building block is a nontrivial starting point. We propose the…
We study the use of triorthogonal codes for universal fault-tolerant quantum computation and propose two methods to circumvent the Eastin-Knill theorem, which prohibits any single quantum error-correcting code from supporting both…
We develop a simulator for quantum computers composed of superconducting transmon qubits. The simulation model supports an arbitrary number of transmons and resonators. Quantum gates are implemented by time-dependent pulses. Nontrivial…
We consider a model of quantum computation we call "Varying-$Z$" (V$Z$), defined by applying controllable $Z$-diagonal Hamiltonians in the presence of a uniform and constant external $X$-field, and prove that it is universal, even in 1D.…
Many quantum algorithms, such as adiabatic algorithms (e.g. AQC) and phase randomisation, require simulating Hamiltonian evolution. In addition, the simulation of physical systems is an important objective in its own right. In many cases,…
Simulation of time dynamical physical problems has been a challenge for classical computers due to their time-complexity. To demonstrate the dominance of quantum computers over classical computers in this regime, here we simulate a…
Solving partial differential equations for extremely large-scale systems within a feasible computation time serves in accelerating engineering developments. Quantum computing algorithms, particularly the Hamiltonian simulations, present a…
The processing unit of a solid-state quantum computer consists in an array of coupled qubits, each locally driven with on-chip microwave lines that route carefully-engineered control signals to the qubits in order to perform logical…
Simple constructions and protocols are demonstrated to allow the implementation of universal quantum computation on an arbitrarily large quantum system by controlling a fixed number of spins, vastly reducing the engineering requirements in…
The quantum approximate optimization algorithm (QAOA) applies two Hamiltonians to a quantum system in alternation. The original goal of the algorithm was to drive the system close to the ground state of one of the Hamiltonians. This paper…
We study the optimal quantum control of heteronuclear two-qubit systems described by a Hamiltonian containing both nonlocal internal drift and local control terms. We derive an explicit formula to compute the minimum time required to steer…
We have studied quantum systems on finite-dimensional Hilbert spaces and found that all these systems are connected through local transformations. Actually, we have shown that these transformations give rise to a gauge group that connects…
This paper presents a simple model that mimics quantum mechanics (QM) results without using complex wavefunctions or non-localities. The proposed model only uses integer-valued quantities and arithmetic operations, in particular assuming a…
Resolving quantum many-body problems represents one of the greatest challenges in physics and physical chemistry, due to the prohibitively large computational resources that would be required by using classical computers. A solution has…
This paper presents a realistic, stochastic, and local model that reproduces nonrelativistic quantum mechanics (QM) results without using its mathematical formulation. The proposed model only uses integer-valued quantities and operations on…
Quantum simulation has become a promising avenue of research that allows one to simulate and gain insight into the models of High Energy Physics whose experimental realizations are either complicated or inaccessible with current technology.…