#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2002

2008

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Benjamin C. Travaglione, Michael A. Nielsen, Howard M. Wiseman, Andris Ambainis
- Quantum Information & Computation
- 2002

We focus on determining the separability of an unknown bipartite quantum state ρ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal observables. We review the concept of an entanglement witness from the geometrical point of view and use this geometry to show… (More)

The phase estimation algorithm is so named because it allows the estimation of the eigenvalues associated with an operator. However it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase estimation algorithm can successfully… (More)

We introduce a model of computation based on read only memory (ROM), which allows us to compare the space-efficiency of reversible, error-free classical computation with reversible, error-free quantum computation. We show that a ROM-based quantum computer with one writable qubit is universal, whilst two writable bits are required for a universal classical… (More)

- Benjamin C. Travaglione
- DAC
- 2003

It appears, in principle, that the laws of quantum mechanics allow a quantum computer to solve certain mathematical problems more rapidly than can be done using a classical computer. However, in order to build such a quantum computer a number of technological problems need to be overcome. A stepping stone to this goal is the implementation of relatively… (More)

This short note describes a method to tackle the (bipartite) quantum separability problem. The method can be used for solving the separability problem in an experimental setting as well as in the purely mathematical setting. The idea is to invoke the following characterization of entangled states: A state is entangled if and only if there exists an… (More)

Let K be a full-dimensional convex subset of Rn. We describe a new polynomialtime Turing reduction from the weak separation problem for K to the weak optimization problem for K that is based on a geometric heuristic. We compare our reduction, which relies on analytic centers, with the standard, more general reduction.

- ‹
- 1
- ›