171 research outputs found
Physics and computer science: quantum computation and other approaches
This is a position paper written as an introduction to the special volume on
quantum algorithms I edited for the journal Mathematical Structures in Computer
Science (Volume 20 - Special Issue 06 (Quantum Algorithms), 2010)
Quantum Walks with Entangled Coins
We present a mathematical formalism for the description of unrestricted
quantum walks with entangled coins and one walker. The numerical behaviour of
such walks is examined when using a Bell state as the initial coin state, two
different coin operators, two different shift operators, and one walker. We
compare and contrast the performance of these quantum walks with that of a
classical random walk consisting of one walker and two maximally correlated
coins as well as quantum walks with coins sharing different degrees of
entanglement.
We illustrate that the behaviour of our walk with entangled coins can be very
different in comparison to the usual quantum walk with a single coin. We also
demonstrate that simply by changing the shift operator, we can generate widely
different distributions. We also compare the behaviour of quantum walks with
maximally entangled coins with that of quantum walks with non-entangled coins.
Finally, we show that the use of different shift operators on 2 and 3 qubit
coins leads to different position probability distributions in 1 and 2
dimensional graphs.Comment: Two new sections and several changes from referees' comments. 12
pages and 12 (colour) figure
Recommended from our members
A Study of Heuristic Guesses for Adiabatic Quantum Computation
Adiabatic quantum computation (AQC) is a universal model for quantum computation which seeks to transform the initial ground state of a quantum system into a final ground state encoding the answer to a computational problem. AQC initial Hamiltonians conventionally have a uniform superposition as ground state. We diverge from this practice by introducing a simple form of heuristics: the ability to start the quantum evolution with a state which is a guess to the solution of the problem. With this goal in mind, we explain the viability of this approach and the needed modifications to the conventional AQC (CAQC) algorithm. By performing a numerical study on hard-to-satisfy 6 and 7 bit random instances of the satisfiability problem (3-SAT), we show how this heuristic approach is possible and we identify that the performance of the particular algorithm proposed is largely determined by the Hamming distance of the chosen initial guess state with respect to the solution. Besides the possibility of introducing educated guesses as initial states, the new strategy allows for the possibility of restarting a failed adiabatic process from the measured excited state as opposed to restarting from the full superposition of states as in CAQC. The outcome of the measurement can be used as a more refined guess state to restart the adiabatic evolution. This concatenated restart process is another heuristic that the CAQC strategy cannot capture.Chemistry and Chemical Biolog
- …