Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Bullock, Stephen S."'
This manuscript introduces various notions of k-locality of stabilizer codes inherited from the associated stabilizer groups. A choice of generators for the group leads to a Hamiltonian with the code in its groundspace, while a Hamiltonian holding th
Externí odkaz:
http://arxiv.org/abs/0802.0626
Autor:
Bullock, Stephen S., Brennen, Gavin K.
Publikováno v:
J.Phys.A40:3481-3505,2007; J.Phys.A40:3481-3506,2007
Surface codes describe quantum memory stored as a global property of interacting spins on a surface. The state space is fixed by a complete set of quasi-local stabilizer operators and the code dimension depends on the first homology group of the surf
Externí odkaz:
http://arxiv.org/abs/quant-ph/0609070
Autor:
Bullock, Stephen S
Let K be the diagonal subgroup of U(2)^{(x)n}. We may view the one-qubit state-space H_1 as a standard representation of U(2) and the n-qubit state space H_n=(H_1)^{(x) n} as the n-fold tensor product of standard representations. Representation theor
Externí odkaz:
http://arxiv.org/abs/quant-ph/0608150
Publikováno v:
Phys. Rev. A 74, 032334 (2006)
Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well known that
Externí odkaz:
http://arxiv.org/abs/quant-ph/0603081
Publikováno v:
Quantum Information and Computation, Vol. 6, 436 (2006)
This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate,
Externí odkaz:
http://arxiv.org/abs/quant-ph/0509161
Publikováno v:
Physical Review Letters, volume 94, 230502 (2005)
As a qubit is a two-level quantum system whose state space is spanned by |0>, |1>, so a qudit is a d-level quantum system whose state space is spanned by |0>,...,|d-1>. Quantum computation has stimulated much recent interest in algorithms factoring u
Externí odkaz:
http://arxiv.org/abs/quant-ph/0410116
Publikováno v:
Physical Review A 71, 052318 (2005).
We describe criteria for implementation of quantum computation in qudits. A qudit is a d-dimensional system whose Hilbert space is spanned by states |0>, |1>,... |d-1>. An important earlier work of Mathukrishnan and Stroud [1] describes how to exactl
Externí odkaz:
http://arxiv.org/abs/quant-ph/0407223
Publikováno v:
IEEE Trans. on Computer-Aided Design, vol. 25, no. 6, June 2006, pp.1000 - 1010
We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the state-space o
Externí odkaz:
http://arxiv.org/abs/quant-ph/0406176
Autor:
Brennen, Gavin K., Bullock, Stephen S.
Publikováno v:
Physical Review A, 70, 052303 (2004).
We investigate the entanglement properties of a one dimensional chain of spin qubits coupled via nearest neighbor interactions. The entanglement measure used is the n-concurrence, which is distinct from other measures on spin chains such as bipartite
Externí odkaz:
http://arxiv.org/abs/quant-ph/0406064
Autor:
Bullock, Stephen S
Publikováno v:
Quantum Information and Computation, vol. 4, no. 5, 396-400 (2004)
Recently, Vatan and Williams utilize a matrix decomposition of SU(2^n) introduced by Khaneja and Glaser to produce CNOT-efficient circuits for arbitrary three-qubit unitary evolutions. In this note, we place the Khaneja Glaser Decomposition (KGD) in
Externí odkaz:
http://arxiv.org/abs/quant-ph/0403141