Related papers: Universal quantum simulation with pre-threshold su…
Superconducting qubits are one of the most promising candidates to implement quantum computers. The superiority of superconducting quantum computers over any classical device in simulating random but well-determined quantum circuits has…
A general scheme to perform universal quantum computation within decoherence-free subspaces (DFSs) of a system's Hilbert space is presented. This scheme leads to the first fault-tolerant realization of universal quantum computation on DFSs…
Although near-term quantum computing devices are still limited by the quantity and quality of qubits in the so-called NISQ era, quantum computational advantage has been experimentally demonstrated. Moreover, hybrid architectures of quantum…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…
In [R. Jozsa, B. Kraus, A. Miyake, J. Watrous, Proc. R. Soc. A {\bf 466}, 809-830 (2010)] it has been shown that a match gate circuit running on n qubits can be compressed to a universal quantum computation on \log(n)+3 qubits. Here, we…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
Recent developments in qudit-based quantum computing, in particular with trapped ions, open interesting possibilities for scaling quantum processors without increasing the number of physical information carriers. In this work, we propose a…
This paper describes a novel approach to emulate a universal quantum computer with a wholly classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any…
Accurate and efficient implementation of parallel quantum gates is crucial for scalable quantum information processing. However, the unavoidable crosstalk between qubits in current noisy processors impedes the achievement of high gate…
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,…
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…
With the increasing size of quantum processors, sub-modules that constitute the processor hardware will become too large to accurately simulate on a classical computer. Therefore, one would soon have to fabricate and test each new design…
Compared with a qubit, a qudit (i.e., $d$-level or $d$-state quantum system) provides a larger Hilbert space to store and process information. On the other hand, qudit-based hybrid quantum computing usually requires performing hybrid…
Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the…
Quantum computing is greatly advanced in recent years and is expected to transform the computation paradigm in the near future. Quantum circuit simulation plays a key role in the toolchain for the development of quantum hardware and…
A key requirement to perform simulations of large quantum systems on near-term quantum hardware is the design of quantum algorithms with short circuit depth that finish within the available coherence time. A way to stay within the limits of…
Quantum computing is powerful because unitary operators describing the time-evolution of a quantum system have exponential size in terms of the number of qubits present in the system. We develop a new "Singular value transformation"…
We present an approach to simulating quantum computation based on a classical model that directly imitates discrete quantum systems. Qubits are represented as harmonic functions in a 2D vector space. Multiplication of qubit representations…
Non-Hermitian (NH) quantum systems demonstrate striking differences from their Hermitian counterparts, leading to claims of NH advantage in areas ranging from metrology to entanglement generation. We show that in the context of quantum…
A proposal for a magnetic quantum processor that consists of individual molecular spins coupled to superconducting coplanar resonators and transmission lines is carefully examined. We derive a simple magnetic quantum electrodynamics…