Related papers: Extending matchgates into universal quantum comput…
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…
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…
The Clifford hierarchy, introduced by Gottesman and Chuang in 1999, is an increasing sequence of sets of quantum gates crucial to the gate teleportation model for fault-tolerant quantum computation. Gates in the hierarchy can be…
A problem of universality in simulation of evolution of quantum system and in theory of quantum computations is related with the possibility of expression or approximation of arbitrary unitary transformation by composition of specific…
Quantum computation and quantum simulation require a versatile gate set to optimize circuit compilation for practical applications. However, existing platforms are often limited to specific gate types or rely on parametric couplers to…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
In unitary circuit games, two competing parties, an "entangler" and a "disentangler", can induce an entanglement phase transition in a quantum many-body system. The transition occurs at a certain rate at which the disentangler acts. We…
We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation.…
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…
We define a model of quantum computation with local fermionic modes (LFMs) -- sites which can be either empty or occupied by a fermion. With the standard correspondence between the Foch space of $m$ LFMs and the Hilbert space of $m$ qubits,…
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as…
Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several…
Fermionic linear optics is efficiently classically simulatable. Here it is shown that the set of states achievable with fermionic linear optics and particle measurements is the closure of a low dimensional Lie group. The weakness of…
In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it…
We propose a scheme for the implementation of quantum gates which is based on the qubit encoding in antiferromagnetic molecular rings. We show that a proper engineering of the intercluster link would result in an effective coupling that…
We supply a rigorous proof that an open dense set of all possible 2-qubit gates G has the property that if the quantum circuit model is restricted to only permit swap of qubits lines and the application of G to pairs of lines, then the…
Though Cliffords and matchgates are both examples of classically simulable circuits, they are considered simulable for different reasons. The celebrated Gottesman-Knill explains the simulability Cliffords, and the efficient simulability of…
The quantum switch is a quantum computational primitive that provides computational advantage by applying operations in a superposition of orders. In particular, it can reduce the number of gate queries required for solving promise problems…
Quantum algorithms offer a dramatic speedup for computational problems in machine learning, material science, and chemistry. However, any near-term realizations of these algorithms will need to be heavily optimized to fit within the finite…
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used…