Michael S. Underwood
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Michael S. Underwood has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- David L. Feder
University of Calgary
2 shared publications Karl-Peter Marzlin
Institute for Quantum Information Science University of Calgary 2500 University Drive NW T2N 1N4 Calgary Alberta Canada
1 shared publication
Latest Publications
- 7 October 2010
- Published by American Physical Society (APS) in Physical Review A
- Vol. 82 (4)
Universal quantum computation by discontinuous quantum walk
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum ``walker'' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution under the Hamiltonian furnished by the adjacency matrix of the graph. We present a hybrid scheme for universal quantum computation in which a quantum walker takes discrete steps of continuous evolution. This ``discontinuous'' quantum walk employs perfect quantum-state transfer between two nodes of specific subgraphs chosen to implement a universal gate set, thereby ensuring unitary evolution without requiring the introduction of an ancillary coin space. The run time is linear in the number of simulated qubits and gates. The scheme allows multiple runs of the algorithm to be executed almost simultaneously by starting walkers one time step apart.
- 7 October 2010
- Published by American Physical Society (APS) in Physical Review A
- Vol. 82 (4)
Universal quantum computation by discontinuous quantum walk
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum ``walker'' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution under the Hamiltonian furnished by the adjacency matrix of the graph. We present a hybrid scheme for universal quantum computation in which a quantum walker takes discrete steps of continuous evolution. This ``discontinuous'' quantum walk employs perfect quantum-state transfer between two nodes of specific subgraphs chosen to implement a universal gate set, thereby ensuring unitary evolution without requiring the introduction of an ancillary coin space. The run time is linear in the number of simulated qubits and gates. The scheme allows multiple runs of the algorithm to be executed almost simultaneously by starting walkers one time step apart.
- Open Access
Universal quantum computation by discontinuous quantum walk
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution under the Hamiltonian furnished by the adjacency matrix of the graph. We present a hybrid scheme for universal quantum computation in which a quantum walker takes discrete steps of continuous evolution. This `discontinuous' quantum walk employs perfect quantum state transfer between two nodes of specific subgraphs chosen to implement a universal gate set, thereby ensuring unitary evolution without requiring the introduction of an ancillary coin space. The run time is linear in the number of simulated qubits and gates. The scheme allows multiple runs of the algorithm to be executed almost simultaneously by starting walkers one timestep apart.
Open AccessUniversal quantum computation by discontinuous quantum walk
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution under the Hamiltonian furnished by the adjacency matrix of the graph. We present a hybrid scheme for universal quantum computation in which a quantum walker takes discrete steps of continuous evolution. This `discontinuous' quantum walk employs perfect quantum state transfer between two nodes of specific subgraphs chosen to implement a universal gate set, thereby ensuring unitary evolution without requiring the introduction of an ancillary coin space. The run time is linear in the number of simulated qubits and gates. The scheme allows multiple runs of the algorithm to be executed almost simultaneously by starting walkers one timestep apart.
- Open Access
Fermi-Frenet coordinates for space-like curves
We generalize Fermi coordinates, which correspond to an adapted set of coordinates describing the vicinity of an observer's worldline, to the worldsheet of an arbitrary spatial curve in a static spacetime. The spatial coordinate axes are fixed using a covariant Frenet triad so that the metric can be expressed using the curvature and torsion of the spatial curve. As an application of Fermi-Frenet coordinates, we show that they allow covariant inertial forces to be expressed in a simple and physically intuitive way.
Open AccessFermi-Frenet coordinates for space-like curves
We generalize Fermi coordinates, which correspond to an adapted set of coordinates describing the vicinity of an observer's worldline, to the worldsheet of an arbitrary spatial curve in a static spacetime. The spatial coordinate axes are fixed using a covariant Frenet triad so that the metric can be expressed using the curvature and torsion of the spatial curve. As an application of Fermi-Frenet coordinates, we show that they allow covariant inertial forces to be expressed in a simple and physically intuitive way.