相关论文: Universal quantum computation with unlabeled qubit…

We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the…

We discuss a new approach to simulate quantum algorithms using classical probabilistic bits and circuits. Each qubit (a two-level quantum system) is initially mapped to a vector in an eight dimensional probability space (equivalently, to a…

We derive an encoded universality representation for a generalized anisotropic exchange Hamiltonian that contains cross-product terms in addition to the usual two-particle exchange terms. The recently developed algebraic approach is used to…

We prove a general limitation in quantum information that unifies the impossibility principles such as no-cloning and no-anticloning. Further, we show that for an unknown qubit one cannot design a universal Hadamard gate for creating equal…

An examination of the concept of using classical degrees of freedom to drive the evolution of quantum computers is given. Specifically, when externally generated, coherent states of the electromagnetic field are used to drive transitions…

Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type…

Quantum amplitude amplification and quantum phase estimation are two fundamental quantum algorithms. All known quantum algorithms are derived from these two algorithms. Even the adiabatic quantum algorithms can also be efficiently simulated…

We present a model for quantum computation using n steady 3-level atoms or 3-level quantum dots, kept inside a quantum electro-dynamics (QED) cavity. Our model allows one-qubit operations and the two-qubit controlled-NOT gate as required…

This note presents a simple and unified formulation of the most fundamental structures used in quantum information with qubits, arbitrary dimension qudits, and quantum continuous variables. This \emph{general quantum variables} construction…

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…

The surface code is currently the primary proposed method for performing quantum error correction. However, despite its many advantages, it has no native method to fault-tolerantly apply non-Clifford gates. Additional techniques are…

The hybrid approach to quantum computation simultaneously utilizes both discrete and continuous variables which offers the advantage of higher density encoding and processing powers for the same physical resources. Trapped ions, with…

We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\tilde{O}(n^{3/2})$ gates for $\sqrt{n}+4$ times, and then using polynomial-time classical post-processing. The correctness of the algorithm…

We present a theoretical framework for universal single-qutrit control in asymmetric-top molecules, advancing molecular quantum information processing. In this approach, the qutrit is encoded in three rotational eigenstates, with an…

We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…

We describe an efficient quantum algorithm for the quantum Schur transform. The Schur transform is an operation on a quantum computer that maps the standard computational basis to a basis composed of irreducible representations of the…

A hybrid classical-quantum approach for the solution of nonlinear ordinary differential equations using Walsh-Hadamard basis functions is proposed. Central to this hybrid approach is the computation of the Walsh-Hadamard transform of…

Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…

Linear-Optical Passive (LOP) devices and photon counters are sufficient to implement universal quantum computation with single photons, and particular schemes have already been proposed. In this paper we discuss the link between the…

The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating…