Stephen S. Bullock
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Stephen S. Bullock has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Igor L. Markov
University of Michigan Ann Arbor MI
5 shared publications - Gavin K. Brennen
Atomic Physics Division National Institute of Standards and Technology 20899-8420 Gaithersburg Maryland
3 shared publications - Dianne P. O'Leary
University of Maryland
2 shared publications - Gavin K. Brennen
Macquarie University
2 shared publications - Vivek Shende
Center for Quantum Mathematics, Syddansk Univ., Campusvej 55 5230 Odense, Denmark
2 shared publications - Vivek V. Shende
Department of Mathematics The University of Michigan
2 shared publications
Latest Publications
- 16 May 2005
- Published by American Physical Society (APS) in Physical Review A
- Vol. 71 (5) , 052318
Criteria for exact qudit universality
We describe criteria for implementation of quantum computation in qudits. A qudit is a -dimensional system whose Hilbert space is spanned by states ∣0⟩, ∣1⟩, …, . An important earlier work [] describes how to exactly simulate an arbitrary unitary on multiple qudits using a parameter family of single qudit and two qudit gates. That technique is based on the spectral decomposition of unitaries. Here we generalize this argument to show that exact universality follows given a discrete set of single qudit Hamiltonians and one two-qudit Hamiltonian. The technique is related to the -matrix decomposition of numerical linear algebra. We consider a generic physical system in which the single qudit Hamiltonians are a small collection of and . A coupling graph results taking nodes 0, …, and edges are allowed Hamiltonians. One qudit exact universality follows iff this graph is connected, and complete universality results if the two-qudit Hamiltonian is also allowed. We discuss implementation in the eight dimensional ground electronic states of and construct an optimal gate sequence using Raman laser pulses.
- 16 May 2005
- Published by American Physical Society (APS) in Physical Review A
- Vol. 71 (5) , 052318
Criteria for exact qudit universality
We describe criteria for implementation of quantum computation in qudits. A qudit is a -dimensional system whose Hilbert space is spanned by states ∣0⟩, ∣1⟩, …, . An important earlier work [] describes how to exactly simulate an arbitrary unitary on multiple qudits using a parameter family of single qudit and two qudit gates. That technique is based on the spectral decomposition of unitaries. Here we generalize this argument to show that exact universality follows given a discrete set of single qudit Hamiltonians and one two-qudit Hamiltonian. The technique is related to the -matrix decomposition of numerical linear algebra. We consider a generic physical system in which the single qudit Hamiltonians are a small collection of and . A coupling graph results taking nodes 0, …, and edges are allowed Hamiltonians. One qudit exact universality follows iff this graph is connected, and complete universality results if the two-qudit Hamiltonian is also allowed. We discuss implementation in the eight dimensional ground electronic states of and construct an optimal gate sequence using Raman laser pulses.
- Open Access
Asymptotically Optimal Quantum Circuits for d-level Systems
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 unitary evolutions of an n-qubit state space into component two-particle unitary evolutions. In the absence of symmetry, Shende, Markov and Bullock use Sard's theorem to prove that at least C 4^n two-qubit unitary evolutions are required, while Vartiainen, Moettoenen, and Salomaa (VMS) use the QR matrix factorization and Gray codes in an optimal order construction involving two-particle evolutions. In this work, we note that Sard's theorem demands C d^{2n} two-qudit unitary evolutions to construct a generic (symmetry-less) n-qudit evolution. However, the VMS result applied to virtual-qubits only recovers optimal order in the case that d is a power of two. We further construct a QR decomposition for d-multi-level quantum logics, proving a sharp asymptotic of Theta(d^{2n}) two-qudit gates and thus closing the complexity question for all d-level systems (d finite.) Gray codes are not required, and the optimal Theta(d^{2n}) asymptotic also applies to gate libraries where two-qudit interactions are restricted by a choice of certain architectures.
Open AccessAsymptotically Optimal Quantum Circuits for d-level Systems
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 unitary evolutions of an n-qubit state space into component two-particle unitary evolutions. In the absence of symmetry, Shende, Markov and Bullock use Sard's theorem to prove that at least C 4^n two-qubit unitary evolutions are required, while Vartiainen, Moettoenen, and Salomaa (VMS) use the QR matrix factorization and Gray codes in an optimal order construction involving two-particle evolutions. In this work, we note that Sard's theorem demands C d^{2n} two-qudit unitary evolutions to construct a generic (symmetry-less) n-qudit evolution. However, the VMS result applied to virtual-qubits only recovers optimal order in the case that d is a power of two. We further construct a QR decomposition for d-multi-level quantum logics, proving a sharp asymptotic of Theta(d^{2n}) two-qudit gates and thus closing the complexity question for all d-level systems (d finite.) Gray codes are not required, and the optimal Theta(d^{2n}) asymptotic also applies to gate libraries where two-qudit interactions are restricted by a choice of certain architectures.
- 4 November 2004
- Published by American Physical Society (APS) in Physical Review A
- Vol. 70 (5) , 052303
Stability of global entanglement in thermal states of spin chains
We investigate the entanglement properties of a one-dimensional chain of qubits coupled via nearest-neighbor spin-spin interactions. The entanglement measure used is the -concurrence, which is distinct from other measures on spin chains such as bipartite entanglement in that it can quantify “global” entanglement across the spin chain. Specifically, it computes the overlap of a quantum state with its time-reversed state. As such, this measure is well suited to study ground states of spin-chain Hamiltonians that are intrinsically time-reversal-symmetric. We study the robustness of -concurrence of ground states when the interaction is subject to a time-reversal antisymmetric magnetic field perturbation. The -concurrence in the ground state of the isotropic model is computed and it is shown that there is a critical magnetic field strength at which the entanglement experiences a jump discontinuity from the maximum value to zero. The -concurrence for thermal mixed states is derived and a threshold temperature is computed below which the system has nonzero entanglement.
- 4 November 2004
- Published by American Physical Society (APS) in Physical Review A
- Vol. 70 (5) , 052303
Stability of global entanglement in thermal states of spin chains
We investigate the entanglement properties of a one-dimensional chain of qubits coupled via nearest-neighbor spin-spin interactions. The entanglement measure used is the -concurrence, which is distinct from other measures on spin chains such as bipartite entanglement in that it can quantify “global” entanglement across the spin chain. Specifically, it computes the overlap of a quantum state with its time-reversed state. As such, this measure is well suited to study ground states of spin-chain Hamiltonians that are intrinsically time-reversal-symmetric. We study the robustness of -concurrence of ground states when the interaction is subject to a time-reversal antisymmetric magnetic field perturbation. The -concurrence in the ground state of the isotropic model is computed and it is shown that there is a critical magnetic field strength at which the entanglement experiences a jump discontinuity from the maximum value to zero. The -concurrence for thermal mixed states is derived and a threshold temperature is computed below which the system has nonzero entanglement.
- Open Access
Stability of global entanglement in thermal states of spin chains
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 entanglement in that it can quantify "global" entanglement across the spin chain. Specifically, it computes the overlap of a quantum state with its time-reversed state. As such this measure is well suited to study ground states of spin chain Hamiltonians that are intrinsically time reversal symmetric. We study the robustness of n-concurrence of ground states when the interaction is subject to a time reversal antisymmetric magnetic field perturbation. The n-concurrence in the ground state of the isotropic XX model is computed and it is shown that there is a critical magnetic field strength at which the entanglement experiences a jump discontinuity from the maximum value to zero. The n-concurrence for thermal mixed states is derived and a threshold temperature is computed below which the system has non zero entanglement.
Open AccessStability of global entanglement in thermal states of spin chains
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 entanglement in that it can quantify "global" entanglement across the spin chain. Specifically, it computes the overlap of a quantum state with its time-reversed state. As such this measure is well suited to study ground states of spin chain Hamiltonians that are intrinsically time reversal symmetric. We study the robustness of n-concurrence of ground states when the interaction is subject to a time reversal antisymmetric magnetic field perturbation. The n-concurrence in the ground state of the isotropic XX model is computed and it is shown that there is a critical magnetic field strength at which the entanglement experiences a jump discontinuity from the maximum value to zero. The n-concurrence for thermal mixed states is derived and a threshold temperature is computed below which the system has non zero entanglement.
- Open Access
Note on the Khaneja Glaser Decomposition
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 context as a SU(2^n)=KAK decomposition by proving that its Cartan involution is type AIII, given n is greater than 2. The standard type AIII involution produces the Cosine-Sine Decomposition (CSD), a well-known decomposition in numerical linear algebra which may be computed using mature, stable algorithms. In the course of our proof that the KGD is type AIII, we further establish the following. Khaneja and Glaser allow for a particular degree of freedom, namely the choice of a commutative algebra a, in their construction. Let SWAP denote a swap between qubits 1 and n. Then for appropriate choice of a, the KGD by (SWAP v SWAP)=k1 a k2 may be recovered from a CSD by v = (SWAP k1 SWAP) (SWAP a SWAP) (SWAP k2 SWAP).
Open AccessNote on the Khaneja Glaser Decomposition
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 context as a SU(2^n)=KAK decomposition by proving that its Cartan involution is type AIII, given n is greater than 2. The standard type AIII involution produces the Cosine-Sine Decomposition (CSD), a well-known decomposition in numerical linear algebra which may be computed using mature, stable algorithms. In the course of our proof that the KGD is type AIII, we further establish the following. Khaneja and Glaser allow for a particular degree of freedom, namely the choice of a commutative algebra a, in their construction. Let SWAP denote a swap between qubits 1 and n. Then for appropriate choice of a, the KGD by (SWAP v SWAP)=k1 a k2 may be recovered from a CSD by v = (SWAP k1 SWAP) (SWAP a SWAP) (SWAP k2 SWAP).
- 19 July 2004
- Published by American Physical Society (APS) in Physical Review A
- Vol. 70 (1) , 012310
Recognizing small-circuit structure in two-qubit operators
This work proposes numerical tests which determine whether a two-qubit operator has an atypically simple quantum circuit. Specifically, we describe formulas, written in terms of matrix coefficients, characterizing operators implementable with exactly zero, one, or two controlled-NOT (CNOT) gates and all other gates being one-qubit gates. We give an algorithm for synthesizing two-qubit circuits with an optimal number of CNOT gates and illustrate it on operators appearing in quantum algorithms by Deutsch-Josza, Shor, and Grover. In another application, our explicit numerical tests allow timing a given Hamiltonian to compute a CNOT modulo one-qubit gate, when this is possible.
- 19 July 2004
- Published by American Physical Society (APS) in Physical Review A
- Vol. 70 (1) , 012310
Recognizing small-circuit structure in two-qubit operators
This work proposes numerical tests which determine whether a two-qubit operator has an atypically simple quantum circuit. Specifically, we describe formulas, written in terms of matrix coefficients, characterizing operators implementable with exactly zero, one, or two controlled-NOT (CNOT) gates and all other gates being one-qubit gates. We give an algorithm for synthesizing two-qubit circuits with an optimal number of CNOT gates and illustrate it on operators appearing in quantum algorithms by Deutsch-Josza, Shor, and Grover. In another application, our explicit numerical tests allow timing a given Hamiltonian to compute a CNOT modulo one-qubit gate, when this is possible.
- 30 June 2004
- Published by American Physical Society (APS) in Physical Review A
- Vol. 69 (6) , 062321
Minimal universal two-qubit controlled-NOT-based circuits
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to a global phase. For several quantum gate libraries we prove that gate counts are optimal in the worst and average cases. Our lower and upper bounds compare favorably to previously published results. Temporary storage is not used because it tends to be expensive in physical implementations. For each gate library, the best gate counts can be achieved by a single universal circuit. To compute the gate parameters in universal circuits, we use only closed-form algebraic expressions, and in particular do not rely on matrix exponentials. Our algorithm has been coded in .- 30 June 2004
- Published by American Physical Society (APS) in Physical Review A
- Vol. 69 (6) , 062321
Minimal universal two-qubit controlled-NOT-based circuits
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to a global phase. For several quantum gate libraries we prove that gate counts are optimal in the worst and average cases. Our lower and upper bounds compare favorably to previously published results. Temporary storage is not used because it tends to be expensive in physical implementations. For each gate library, the best gate counts can be achieved by a single universal circuit. To compute the gate parameters in universal circuits, we use only closed-form algebraic expressions, and in particular do not rely on matrix exponentials. Our algorithm has been coded in .- Open Access
Minimal Universal Two-qubit Quantum Circuits
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare favorably to previously published results. Temporary storage is not used because it tends to be expensive in physical implementations. For each gate library, best gate counts can be achieved by a single universal circuit. To compute gate parameters in universal circuits, we only use closed-form algebraic expressions, and in particular do not rely on matrix exponentials. Our algorithm has been coded in C++.
Open AccessMinimal Universal Two-qubit Quantum Circuits
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare favorably to previously published results. Temporary storage is not used because it tends to be expensive in physical implementations. For each gate library, best gate counts can be achieved by a single universal circuit. To compute gate parameters in universal circuits, we only use closed-form algebraic expressions, and in particular do not rely on matrix exponentials. Our algorithm has been coded in C++.
- Open Access
Canonical Decompositions of n-qubit Quantum Computations and Concurrence
The two-qubit canonical decomposition SU(4) = [SU(2) \otimes SU(2)] Delta [SU(2) \otimes SU(2)] writes any two-qubit quantum computation as a composition of a local unitary, a relative phasing of Bell states, and a second local unitary. Using Lie theory, we generalize this to an n-qubit decomposition, the concurrence canonical decomposition (C.C.D.) SU(2^n)=KAK. The group K fixes a bilinear form related to the concurrence, and in particular any computation in K preserves the tangle ||^2 for n even. Thus, the C.C.D. shows that any n-qubit quantum computation is a composition of a computation preserving this n-tangle, a computation in A which applies relative phases to a set of GHZ states, and a second computation which preserves it. As an application, we study the extent to which a large, random unitary may change concurrence. The result states that for a randomly chosen a in A within SU(2^{2p}), the probability that a carries a state of tangle 0 to a state of maximum tangle approaches 1 as the even number of qubits approaches infinity. Any v=k_1 a k_2 for such an a \in A has the same property. Finally, although ||^2 vanishes identically when the number of qubits is odd, we show that a more complicated C.C.D. still exists in which K is a symplectic group.
Open AccessCanonical Decompositions of n-qubit Quantum Computations and Concurrence
The two-qubit canonical decomposition SU(4) = [SU(2) \otimes SU(2)] Delta [SU(2) \otimes SU(2)] writes any two-qubit quantum computation as a composition of a local unitary, a relative phasing of Bell states, and a second local unitary. Using Lie theory, we generalize this to an n-qubit decomposition, the concurrence canonical decomposition (C.C.D.) SU(2^n)=KAK. The group K fixes a bilinear form related to the concurrence, and in particular any computation in K preserves the tangle ||^2 for n even. Thus, the C.C.D. shows that any n-qubit quantum computation is a composition of a computation preserving this n-tangle, a computation in A which applies relative phases to a set of GHZ states, and a second computation which preserves it. As an application, we study the extent to which a large, random unitary may change concurrence. The result states that for a randomly chosen a in A within SU(2^{2p}), the probability that a carries a state of tangle 0 to a state of maximum tangle approaches 1 as the even number of qubits approaches infinity. Any v=k_1 a k_2 for such an a \in A has the same property. Finally, although ||^2 vanishes identically when the number of qubits is odd, we show that a more complicated C.C.D. still exists in which K is a symplectic group.
- Open Access
Recognizing Small-Circuit Structure in Two-Qubit Operators and Timing Hamiltonians to Compute Controlled-Not Gates
This work proposes numerical tests which determine whether a two-qubit operator has an atypically simple quantum circuit. Specifically, we describe formulae, written in terms of matrix coefficients, characterizing operators implementable with exactly zero, one, or two controlled-not (CNOT) gates and all other gates being one-qubit. We give an algorithm for synthesizing two-qubit circuits with optimal number of CNOT gates, and illustrate it on operators appearing in quantum algorithms by Deutsch-Josza, Shor and Grover. In another application, our explicit numerical tests allow timing a given Hamiltonian to compute a CNOT modulo one-qubit gates, when this is possible.
Open AccessRecognizing Small-Circuit Structure in Two-Qubit Operators and Timing Hamiltonians to Compute Controlled-Not Gates
This work proposes numerical tests which determine whether a two-qubit operator has an atypically simple quantum circuit. Specifically, we describe formulae, written in terms of matrix coefficients, characterizing operators implementable with exactly zero, one, or two controlled-not (CNOT) gates and all other gates being one-qubit. We give an algorithm for synthesizing two-qubit circuits with optimal number of CNOT gates, and illustrate it on operators appearing in quantum algorithms by Deutsch-Josza, Shor and Grover. In another application, our explicit numerical tests allow timing a given Hamiltonian to compute a CNOT modulo one-qubit gates, when this is possible.