Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate

Bremner, Michael J.; Dawson, Christopher M.; Dodd, Jennifer L.; Gilchrist, Alexei; Harrow, Aram W.; Mortimer, Duncan; Nielsen, Michael A.; Osborne, Tobias J.

doi:10.1103/physrevlett.89.247902

Cited by 224 publications

(189 citation statements)

References 14 publications

(22 reference statements)

Supporting

Mentioning

186

Contrasting

Unclassified

Order By: Relevance

“…, iH q } assuming all H ν are represented by Hermitian matrices henceforth. If so, then for every evolution time τ > 0 of a simulated interaction iH k ∈ Q, there is a solution U (t) of the simulating system (1) for 0 ≤ t ≤ θ and controls u ν (t) such that P generates a unitary U (θ) = exp(−iτ H k ) in the simulation time θ starting from the identity at t = 0 [6,[24][25][26][27][28][29][30], [31]. In this sense, Hamiltonian simulation of a particular Hamiltonian H k can be considered as an infinitesimal version of creating a particular unitary gate.…”

Section: Introductionmentioning

confidence: 99%

Symmetry criteria for quantum simulability of effective interactions

et al. 2015

View full text Add to dashboard Cite

What can one do with a given tunable quantum device? We provide complete symmetry criteria deciding whether some effective target interaction(s) can be simulated by a set of given interactions. Symmetries lead to a better understanding of simulation and permit a reasoning beyond the limitations of the usual explicit Lie closure. Conserved quantities induced by symmetries pave the way to a resource theory for simulability. On a general level, one can now decide equality for any pair of compact Lie algebras just given by their generators without determining the algebras explicitly. Several physical examples are illustrated, including entanglement invariants, the relation to unitary gate membership problems, as well as the central-spin model.

show abstract

Section: Introductionmentioning

confidence: 99%

Symmetry criteria for quantum simulability of effective interactions

et al. 2015

View full text Add to dashboard Cite

show abstract

“…Any gate that creates entanglement between qudits without ancillas acts as a universal gate for quantum computation when assisted by arbitrary one-qudit gates [14,15]. Therefore, the SUM gate [16,17,18,19] [a generalization of the controlled-NOT (CNOT) gate for qubits] can be chosen as the basic, or primitive, two-qudit gate for qudit-based quantum computation.…”

Section: Introductionmentioning

confidence: 99%

Entangling power and operator entanglement in qudit systems

2003

View full text Add to dashboard Cite

We establish the entangling power of a unitary operator on a general finite-dimensional bipartite quantum system with and without ancillas, and give relations between the entangling power based on the von Neumann entropy and the entangling power based on the linear entropy. Significantly, we demonstrate that the entangling power of a general controlled unitary operator acting on two equaldimensional qudits is proportional to the corresponding operator entanglement if linear entropy is adopted as the quantity representing the degree of entanglement. We discuss the entangling power and operator entanglement of three representative quantum gates on qudits: the SUM, double SUM, and SWAP gates.

show abstract

“…Ref. [36] shows that any conditional quantum phase gate is universal, since all quantum computations can be realized by combining it and rotations of individual qubits. For example, with the choice of t = π λ ′ , a two-qubit controlled-Z gate is obtained, which is a familiar two-qubit universal logic gate [37].…”

Section: The Fundamental Model and Tunable Quantum Phase Gate Witmentioning

confidence: 99%

Scheme for tunable quantum phase gate and effective preparation of graph-state entanglement

Lin

Zou

et al. 2008

Phys. Rev. A

View full text Add to dashboard Cite

A scheme is presented for realizing a quantum phase gate with three-level atoms, solid-state qubits-often called artificial atoms, or ions that share a quantum data bus such as a single mode field in cavity QED system or a collective vibrational state of trapped ions. In this scheme, the conditional phase shift is tunable and controllable via the total effective interaction time. Furthermore, we show that the method can be used for effective preparation of graph-state entanglement, which are important resources for quantum computation, quantum error correction, studies of multiparticle entanglement, fundamental tests of non-locality and decoherence.

show abstract

Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate

Cited by 224 publications

References 14 publications

Symmetry criteria for quantum simulability of effective interactions

Symmetry criteria for quantum simulability of effective interactions

Entangling power and operator entanglement in qudit systems

Scheme for tunable quantum phase gate and effective preparation of graph-state entanglement

Contact Info

Product

Resources

About