Related papers: Implementation of Quantum Fourier Transform and Si…
We show that the problem of communication in a quantum computer reduces to constructing reliable quantum channels by distributing high-fidelity EPR pairs. We develop analytical models of the latency, bandwidth, error rate and resource…
Quantum computers will allow calculations beyond existing classical computers. However, current technology is still too noisy and imperfect to construct a universal digital quantum computer with quantum error correction. Inspired by the…
Recent advancements of intermediate-scale quantum processors have triggered tremendous interest in the exploration of practical quantum advantage. The simulation of fluid dynamics, a highly challenging problem in classical physics but vital…
We present four quantum algorithms for solving a multidimensional drift-diffusion equation. They rely on a quantum linear system solver, a quantum Hamiltonian simulation, a quantum random walk, and the quantum Fourier transform. We compare…
Future quantum computers may serve as a tool to access non-perturbative real-time correlation functions. In this talk, we discuss the prospects of using these to study Compton scattering for arbitrary kinematics. The restriction to a…
We present a simple new way - called Schrodingerisation - to simulate general linear partial differential equations via quantum simulation. Using a simple new transform, referred to as the warped phase transformation, any linear partial…
Coupling qubits together towards large-scale integration is a key point for realizing a quantum computer. We study the capacitively coupled superconducting phase qubits using two diagonalization methods, which are very efficient to obtain…
Derivation of tight-binding model from Schroedinger formalism for various topologies of position-based semiconductor qubits is presented in this work in case of static and time-dependent electric fields. Simplistic tight-binding model…
The electronic spin degrees of freedom in semiconductors typically have decoherence times that are several orders of magnitude longer than other relevant timescales. A solid-state quantum computer based on localized electron spins as qubits…
In this Letter, we present a physical scheme for implementing the discrete quantum Fourier transform in a coupled semiconductor double quantum dot system. The main controlled-R gate operation can be decomposed into many simple and feasible…
We present a method for classically simulating quantum circuits based on the tensor contraction model of Markov and Shi (quant-ph/0511069). Using this method we are able to classically simulate the approximate quantum Fourier transform in…
The results of quantum process tomography on a three-qubit nuclear magnetic resonance quantum information processor are presented, and shown to be consistent with a detailed model of the system-plus-apparatus used for the experiments. The…
We present a fault-tolerant quantum algorithm for implementing the Discrete Variable Representation (DVR) transformation, a technique widely used in simulations of quantum-mechanical Hamiltonians. DVR provides a diagonal representation of…
This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the amplitudes of the electromagnetic field…
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrodinger equation for interacting many-body systems are presented in some detail. These…
Generalized Fourier transformation between the position and the momentum representation of a quantum state is constructed in a coordinate independent way. The only ingredient of this construction is the symplectic (canonical) geometry of…
We present the detailed process of converting the classical Fourier Transform algorithm into the quantum one by using QR decomposition. This provides an example of a technique for building quantum algorithms using classical ones. The…
Quantum Fourier transform is of primary importance in many quantum algorithms. In order to eliminate the destructive effects of decoherence induced by couplings between the quantum system and its environment, we propose a robust scheme for…
Numerical modeling of radio-frequency waves in plasma with sufficiently high spatial and temporal resolution remains challenging even with modern computers. However, such simulations can be sped up using quantum computers in the future.…
In this paper, an algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. Analogous to a classical discrete signal, a quantum signal can be represented in Dirac notation, application of QIFFT is a…