753 citations · 1.2k across the 7 of their papers we have counts for
9 papers
The Dynamics of 1D Quantum Spin Systems Can Be Approximated Efficiently
Tobias J. Osborne
In this Letter we show that an arbitrarily good approximation to the propagator e^{itH} for a 1D lattice of n quantum spins with hamiltonian H may be obtained with polynomial compu…
Lower Bound for the Ground-State Energy Density of a 1D Quantum Spin System
Tobias J. Osborne
We present a simple method to calculate systematic lower bounds for the ground-state energy density of a 1D quantum spin system.
General Monogamy Inequality for Bipartite Qubit Entanglement
Tobias J. Osborne, Frank Verstraete
We consider multipartite states of qubits and prove that their bipartite quantum entanglement, as quantified by the concurrence, satisfies a monogamy inequality conjectured by Coff…
Quantum computing and polynomial equations over the finite field Z_2
Christopher M. Dawson, Henry L. Haselgrove, Andrew P. Hines +3
What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily c…
Quantum Algorithms and Covering Spaces
Tobias J. Osborne, Simone Severini
In this paper we isolate the combinatorial property responsible (at least in part) for the computational speedups recently observed in some quantum walk algorithms. We find that co…
The Propagation of Quantum Information Through a Spin System
Tobias J. Osborne, Noah Linden
It has been recently suggested that the dynamics of a quantum spin system may provide a natural mechanism for transporting quantum information. We show that one dimensional rings o…