Related papers: Generalised Quantum Gates for Qudits and their App…

A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…

Fault-tolerant logic gates will consume a large proportion of the resources of a two-dimensional quantum computing architecture. Here we show how to perform a fault-tolerant non-Clifford gate with the surface code; a quantum…

For the solution of partial differential equations (PDEs), we show that the quantum Fourier transform (QFT) can enable the design of quantum circuits that are particularly simple, both conceptually and with regard to hardware requirements.…

The Discrete Fourier Transform (DFT) is central to the analysis of uniformly sampled signals, yet many practical applications involve non-uniform sampling, requiring the Non-Uniform Discrete Fourier Transform (NUDFT). While quantum…

We prove the existence of a class of two--input, two--output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three--bit gate introduced by Deutsch [Proc.~R.~Soc.~London.~A {\bf 425},…

A set of universal quantum gates is a vital part of the theory of quantum computing, but is absent in the developing theory of Relativistic Quantum Information (RQI). Yet, the Unruh--DeWitt (UDW) detector formalism can be elevated to…

Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…

Quantum computing with qudits, an extension of qubits to multiple levels, is a research field less mature than qubit-based quantum computing. However, qudits can offer some advantages over qubits, by representing information with fewer…

It has previously been established that the logarithmic-depth approximate quantum Fourier transform (AQFT) provides a suitable replacement for the regular QFT in many quantum algorithms. Since the AQFT is less accurate by definition,…

We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…

Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…

The qubit SWAP gate has been shown to be an integral component of quantum circuitry design. It permutes the states of two qubits and allows for the storage quantum information, teleportation of atomic or ionic states, and is a fundamental…

The discrete Fourier transform (DFT) is of fundamental interest in photonic quantum information, yet the ability to scale it to high dimensions depends heavily on the physical encoding, with practical recipes lacking in emerging platforms…

Gradient-based optimization is a key ingredient of variational quantum algorithms, with applications ranging from quantum machine learning to quantum chemistry and simulation. The parameter-shift rule provides a hardware-friendly method for…

Simon's problem admits an exponential quantum speedup, but current quantum devices support only qubits. This work introduces a general construction for simulating qudit versions of Simon's algorithm on qubit hardware by defining virtual…

Algorithms for quantum information processing are usually decomposed into sequences of quantum gate operations, most often realized with single- and two- qubit gates[1]. While such operations constitute a universal set for quantum…

Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…

Achieving scalable, fault-tolerant quantum computation requires quantum memory architectures that minimize error correction overhead while preserving coherence. This work presents a framework for high-dimensional qudit memory in…

In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when…

We present a one-step scheme to construct the controlled-phase gate deterministically on remote transmon qutrits coupled to different resonators connected by a superconducting transmission line for an universal distributed quantum…