Ground State Quantum Computation
classification
🪐 quant-ph
keywords
quantumgroundstateapproachcomputationqubitscompletelycomputer
read the original abstract
We formulate a novel ground state quantum computation approach that requires no unitary evolution of qubits in time: the qubits are fixed in stationary states of the Hamiltonian. This formulation supplies a completely time-independent approach to realizing quantum computers. We give a concrete suggestion for a ground state quantum computer involving linked quantum dots.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.