#### Filter Results:

- Full text PDF available (25)

#### Publication Year

1995

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Vivek V. Shende, Stephen S. Bullock, Igor L. Markov
- IEEE Transactions on Computer-Aided Design of…
- 2005

The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits to the attention of the EDA community [10, 17, 4, 16, 9]. We discuss efficient circuits to initialize quantum registers and implement generic quantum computations. Our techniques yield circuits that… (More)

- Stephen S. Bullock, Igor L. Markov
- Quantum Information & Computation
- 2004

A unitary operator U = ∑ j,k u j,k |k j| is called diagonal when u j,k = 0 unless j = k. The definition extends to quantum computations , where j and k vary over the 2 n binary expressions for integers 0, 1 · · · , 2 n − 1, given n qubits. Such operators do not affect outcomes of the projective measurement { j| ; 0 ≤ j ≤ 2 n − 1} but rather create arbitrary… (More)

- C W Hanke, G Bernstein, S Bullock
- Dermatologic surgery : official publication for…
- 1995

BACKGROUND
Tumescent liposuction is a new method of liposuction under local anesthesia that has been developed by dermatologic surgeons.
OBJECTIVE
To determine the safety of tumescent liposuction in a large group of patients treated by dermatologic surgeons.
METHODS
A survey questionnaire was sent to 1,778 Fellows of the American Society for… (More)

- Stephen S Bullock, Dianne P O'Leary, Gavin K Brennen
- Physical review letters
- 2005

Scalability of a quantum computation requires that the information be processed on multiple subsystems. However, it is unclear how the complexity of a quantum algorithm, quantified by the number of entangling gates, depends on the subsystem size. We examine the quantum circuit complexity for exactly universal computation on many d-level systems (qudits).… (More)

Quantum circuits currently constitute a dominant model for quantum computation [14]. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates [1, 15] as possible. Our lower… (More)

- C W Hanke, S S Bullock
- Facial plastic surgery : FPS
- 1995

Operators acting on a collection of two-level quantum-mechanical systems can be represented by quantum circuits. This work presents a new universal quantum circuit capable of implementing any unitary operator. The circuit has a top-down structure, and the parameters for individual unitaries can be computed using standard matrix analysis algorithms. The… (More)

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… (More)

- Vivek V. Shende, Igor L. Markov, Stephen S. Bullock
- Proceedings Design, Automation and Test in Europe…
- 2004

We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to library-less logic synthesis, we consider circuits and gates in terms of the underlying model of quantum computation, and do not assume any particular technology. As increasing the… (More)

- Stephen S. Bullock
- Quantum Information & Computation
- 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 context as a SU(2 n) = KAK decomposition by proving that its Cartan invo-lution is type AIII, given n ≥ 3.… (More)