Related papers: Implementing quantum Fourier transform using three…
Gate-based quantum computation has been extensively investigated using quantum circuits based on qubits. In many cases, such qubits are actually made out of multilevel systems but with only two states being used for computational purpose.…
The accurate implementation of quantum gates is essential for the realisation of quantum algorithms and digital quantum simulations. This accuracy may be increased on noisy hardware through the variational optimisation of gates, however the…
We propose and validate on real quantum computing hardware a new method for extended two-qubit gate set design, replacing iterative, fine calibration with fast characterization of a small number of gate parameters which are then tracked and…
The quantum phase transition (QPT) of the one-dimensional (1D) quantum compass model in a transverse magnetic field is studied in this paper. An exact solution is obtained by using an extended Jordan and Wigner transformation to the…
Simulating quantum physics with a device which itself is quantum mechanical, a notion Richard Feynman originated, would be an unparallelled computational resource. However, the universal quantum simulation of fermionic systems is daunting…
Optimal control of qubits requires the ability to adapt continuously to their ever-changing environment. We demonstrate a real-time control protocol for a two-electron singlet-triplet qubit with two fluctuating Hamiltonian parameters. Our…
We develop a method to synthesize a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. The only requirement on the flexibility of the interaction is that it…
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 propose to implement quantum computing based on electronic spin qubits by controlling the propagation of the electron wave packets through the helical edge states of quantum spin Hall systems (QSHs). Specfically, two non-commutative…
Quantum circuits which perform integer arithmetic could potentially outperform their classical counterparts. In this paper, a quantum circuit is considered which performs a specific computational pattern on classically represented integers…
Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such…
Quantum computing promises transformative impacts in simulating Hamiltonian dynamics, essential for studying physical systems inaccessible by classical computing. However, existing compilation techniques for Hamiltonian simulation, in…
The construction of quantum computer simulators requires advanced software which can capture the most significant characteristics of the quantum behavior and quantum states of qubits in such systems. Additionally, one needs to provide valid…
The Quantum Fourier Transform offers an interesting way to perform arithmetic operations on a quantum computer. We review existing Quantum Fourier Transform adders and multipliers and propose some modifications that extend their…
In this work, we present a rigorous accuracy analysis of the quantum Fourier transform (QFT), that identifies three natural sources of accuracy degeneracy: (i) discretization accuracy inherited from classical sampling theory, (ii) accuracy…
Hybrid qubit-qumode quantum computing platforms provide a natural setting for simulating interacting bosonic quantum field theories. However, existing continuous-variable gate constructions rely predominantly on polynomial functions of…
We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed…
Developing quantum computers for real-world applications requires understanding theoretical sources of quantum advantage and applying those insights to design more powerful machines. Toward that end, we introduce a high-fidelity gate set…
We investigate quantum phase transitions (QPTs) in spin chain systems characterized by local Hamiltonians with matrix product ground states. We show how to theoretically engineer such QPT points between states with predetermined properties.…
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=(\omega^{ij})_{N\times N},i,j=0,1,..., N-1,…