Related papers: Universal Quantum Computation with ideal Clifford …
One of the limitations to the quantum computing capability of a continuous-variable system is determined by our ability to cool it to the ground state, because pure logical states, in which we accurately encode quantum information, are…
Random quantum circuits continue to inspire a wide range of applications in quantum information science and many-body quantum physics, while remaining analytically tractable through probabilistic methods. Motivated by an interest in…
Quantum gates executed on physical hardware are inevitably degraded by environmental noise. While state purification effectively distills static quantum resources, the dynamic execution of quantum algorithms requires a higher-order approach…
A generalized universal quantum cloning machine is proposed which allows the input to be arbitrary states in symmetric subspace. And it reduces to the universal quantum cloning machine (UQCM) if the input are identical pure states. The…
We consider topological quantum computation (TQC) with a particular class of anyons that are believed to exist in the Fractional Quantum Hall Effect state at Landau level filling fraction nu=5/2. Since the braid group representation…
One-way quantum computation, also known as Cluster State Quantum Computation, provides a robust and efficient tool to perform universal quantum computation using only single-qubit projective measurements, given a highly entangled cluster…
Measurements play an important role in quantum computing (QC), by either providing the nonlinearity required for two-qubit gates (linear optics QC), or by implementing a quantum algorithm using single-qubit measurements on a highly…
Topological quantum computing promises intrinsic fault tolerance by encoding quantum information in non-Abelian anyons, where quantum gates are implemented via braiding. While braiding operations are robust against local perturbations, a…
We study how heralded qubit losses during the preparation of a two-dimensional cluster state, a universal resource state for one-way quantum computation, affect its computational power. Above the percolation threshold we present a…
Quantum channels underlie the dynamics of quantum systems, but in many practical settings it is the channels themselves that require processing. We establish universal limitations on the processing of both quantum states and channels,…
We have unified quantum and classical computing in open quantum systems called qACP which is a quantum generalization of process algebra ACP. But, an axiomatization for quantum and classical processes with an assumption of closed quantum…
One of the fundamental conditions for one-way quantum computation (1WQC) is the ability to make sequential measurements on isolated qubits that comprise the highly entangled resource for 1WQC, the cluster state. This has been a significant…
Measurement-based quantum computation (MBQC) represents a powerful and flexible framework for quantum information processing, based on the notion of entangled quantum states as computational resources. The most prominent application is the…
What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate suffices, except those that preserve the computational basis.…
Quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state, such as the ground state of an interacting many-body system. We investigate a simple spin-lattice system based on the cluster-state…
We present an approach to one-way quantum computation (1WQC) that can compensate for single-qubit errors, by encoding the logical information residing on physical qubits into five-qubit error-correcting code states. A logical two-qubit…
We propose a method of manipulating a quantum register remotely with the help of a single ancilla that steers the evolution of the register. The fully controlled ancilla qubit is coupled to the computational register solely via a fixed…
We propose a complete, quantitative quantum computing system which satisfies the five DiVincenzo criteria. The model is based on magnetic clusters with uniaxial anisotropy, where standard, two-state qubits are formed utilizing the two…
Magic states enable universal, fault-tolerant quantum computation within the stabilizer framework. Their non-stabilizerness supplies the resource needed to bypass the Eastin-Knill theorem while allowing fault-tolerant distillation. Although…
We use our Clifford algebra technique, that is nilpotents and projectors which are binomials of the Clifford algebra objects $\gamma^a$ with the property $\{\gamma^a,\gamma^b\}_+ = 2 \eta^{ab}$, for representing quantum gates and quantum…