MUMichael S. Underwood

Michael S. Underwood

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Michael S. Underwood has a total of 2 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Universal quantum computation by discontinuous quantum walk

    by Michael S. Underwood, David L. Feder

    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

    by Michael S. Underwood, David L. Feder

    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

    by Michael S. Underwood, Karl-Peter Marzlin

    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.