Multi-qubit quantum computing using discrete-time quantum walks on
closed graphs
- URL: http://arxiv.org/abs/2004.05956v2
- Date: Tue, 24 Aug 2021 06:31:27 GMT
- Title: Multi-qubit quantum computing using discrete-time quantum walks on
closed graphs
- Authors: Prateek Chawla, Shivani Singh, Aman Agarwal, Sarvesh Srinivasan, C. M.
Chandrashekar
- Abstract summary: Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks.
We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks.
- Score: 2.781051183509143
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Universal quantum computation can be realised using both continuous-time and
discrete-time quantum walks. We present a version based on single particle
discrete-time quantum walk to realize multi-qubit computation tasks. The
scalability of the scheme is demonstrated by using a set of walk operations on
a closed lattice form to implement the universal set of quantum gates on
multi-qubit system. We also present a set of experimentally realizable walk
operations that can implement Grover's algorithm, quantum Fourier
transformation and quantum phase estimation algorithms. An elementary
implementation of error detection and correction is also presented. Analysis of
space and time complexity of the scheme highlights the advantages of quantum
walk based model for quantum computation on systems where implementation of
quantum walk evolution operations is an inherent feature of the system.
Related papers
- Quantum Phase Processing and its Applications in Estimating Phase and
Entropies [10.8525801756287]
"quantum phase processing" can directly apply arbitrary trigonometric transformations to eigenphases of a unitary operator.
Quantum phase processing can extract the eigen-information of quantum systems by simply measuring the ancilla qubit.
We propose a new quantum phase estimation algorithm without quantum Fourier transform, which requires the fewest ancilla qubits and matches the best performance so far.
arXiv Detail & Related papers (2022-09-28T17:41:19Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Variational Quantum Anomaly Detection: Unsupervised mapping of phase
diagrams on a physical quantum computer [0.0]
We propose variational quantum anomaly detection, an unsupervised quantum machine learning algorithm to analyze quantum data from quantum simulation.
The algorithm is used to extract the phase diagram of a system with no prior physical knowledge.
We show that it can be used with readily accessible devices nowadays and perform the algorithm on a real quantum computer.
arXiv Detail & Related papers (2021-06-15T06:54:47Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Exploiting dynamic quantum circuits in a quantum algorithm with
superconducting qubits [0.207811670193148]
We build dynamic quantum circuits on a superconducting-based quantum system.
We exploit one of the most fundamental quantum algorithms, quantum phase estimation, in its adaptive version.
We demonstrate that the version of real-time quantum computing with dynamic circuits can offer a substantial and tangible advantage.
arXiv Detail & Related papers (2021-02-02T18:51:23Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - Floquet engineering of continuous-time quantum walks: towards the
simulation of complex and next-to-nearest neighbor couplings [0.0]
We apply the idea of Floquet engineering in the context of continuous-time quantum walks on graphs.
We define periodically-driven Hamiltonians which can be used to simulate the dynamics of certain target quantum walks.
Our work provides explicit simulation protocols that may be used for directing quantum transport, engineering the dispersion relation of one-dimensional quantum walks or investigating quantum dynamics in highly connected structures.
arXiv Detail & Related papers (2020-12-01T12:46:56Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z) - Quantum walks and Dirac cellular automata on a programmable trapped-ion
quantum computer [1.2324860823895265]
We present the circuit-based implementation of a discrete-time quantum walk in position space on a five-qubit trapped-ion quantum processor.
We encode the space of walker positions in particular multi-qubit states and program the system to operate with different quantum walk parameters, experimentally realizing a Dirac cellular automaton with tunable mass parameter.
The quantum walk circuits and position state mapping scale favorably to a larger model and physical systems, allowing the implementation of any algorithm based on discrete-time quantum walks algorithm and the dynamics associated with the discretized version of the Dirac equation.
arXiv Detail & Related papers (2020-02-06T22:24:56Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.