相关论文: A universal quantum rewinding protocol with an arb…
Some two qubit interactions are singly sufficient for universal quantum computation but not without the use of an ancilla. Recent schemes for universal quantum computation have focused on hybrid physical systems using ancillae. In them, the…
Quantum protocols for secret sharing usually rely on multi-party entanglement which with present technology is very difficult to achieve. Recently it has been shown that sequential manipulation and communication of a single $d-$ level state…
Qubit connectivity is an important property of a quantum processor, with an ideal processor having random access -- the ability of arbitrary qubit pairs to interact directly. Here, we implement a random access superconducting quantum…
We show how to construct a universal set of quantum logic gates using control over exchange interactions and single- and two-spin measurements only. Single-spin unitary operations are teleported instead of being executed directly, thus…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
We propose a universal quantum computing scheme in which the orthogonal qubit states $|0>$ and $|1>$ are identical in their single-particle spin and charge properties. Each qubit is contained in a single quantum dot and gate operations are…
Controlling quantum systems is crucial for quantum computation and a variety of new quantum technologies. The control is typically achieved by breaking down the target dynamics into a sequence of elementary gates,whose description can be…
In the interaction picture, a sufficient and necessary condition that guarantees the convergence of closed quantum control system is proposed in this paper. Theoretical derivation and the proof show that it is possible to achieve the…
The paper presents general protocols for quantum teleportation between multiparties. It is shown how N parties can teleport N unknown quantum states to M other parties with the use of N+M qudits in the maximally entangled state. It is also…
Transition State Theory forms the basis of computing reaction rates in chemical and other systems. Recently it has been shown how transition state theory can rigorously be realized in phase space using an explicit algorithm. The…
According to Deutsch, a universal quantum Turing machine (UQTM) is able to perform, in repeating a fixed unitary transformation on the total system, an arbitrary unitary transformation on an arbitrary data state, by including a program as…
In this paper we consider the quantum repeater protocol for distributing the entanglement to two distant three-level atoms. In this protocol, we insert six atoms between two target atoms such that the eight considered atoms are labeled by…
Overcoming the influence of noise and imperfections is a major challenge in quantum computing. Here, we present an approach based on applying a desired unitary computation in superposition between the system of interest and some auxiliary…
The universal transpose of quantum states is an anti-unitary transformation that is not allowed in quantum theory. In this work, we investigate approximating the universal transpose of quantum states of two-level systems (qubits) using the…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
It is proved that a quantum computer with fixed and permanent interaction of diagonal type between qubits proposed in the work quant-ph/0201132 is universal. Such computer is controlled only by one-qubit quick transformations, and this…
The universal quantum cloning machine and the universal NOT gate acting on a single qubit can be implemented very generally by slightly modifying the protocol of quantum state teleportation. The experimental demonstration of the 1 to 2…
Applying post selection in each step of an iterated protocol leads to sensitive quantum dynamics that may be utilized to test and benchmark current quantum computers. An example of this type of protocols was originally proposed for the task…
Quantum teleportation allows to transfer unknown quantum states between distant parties. It is not only a primitive of quantum communications but also an essential task in realization of the quantum networks for promising applications such…
In classical control theory, tracking refers to the ability to perform measurements and feedback on a classical system in order to enforce some desired dynamics. In this paper we investigate a simple version of quantum tracking, namely, we…