Implementing Quantum Gates Using Length-3 Dynamic Quantum Walks

• URL: http://arxiv.org/abs/2108.01055v2
• Date: Thu, 30 Sep 2021 19:01:12 GMT
• Title: Implementing Quantum Gates Using Length-3 Dynamic Quantum Walks
• Authors: Ibukunoluwa A. Adisa, Thomas G. Wong
• Abstract summary: We develop a length-3 dynamic quantum walk that implements any single-qubit gate. We extend this result to give length-3 dynamic quantum walks that implement any single-qubit gate controlled by any number of qubits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is well-known that any quantum gate can be decomposed into the universal gate set {T, H, CNOT}, and recent results have shown that each of these gates can be implemented using a dynamic quantum walk, which is a continuous-time quantum walk on a sequence of graphs. This procedure for converting a quantum gate into a dynamic quantum walk, however, can result in long sequences of graphs. To alleviate this, in this paper, we develop a length-3 dynamic quantum walk that implements any single-qubit gate. Furthermore, we extend this result to give length-3 dynamic quantum walks that implement any single-qubit gate controlled by any number of qubits. Using these, we implement Draper's quantum addition circuit, which is based on the quantum Fourier transform, using a dynamic quantum walk.

Related papers

• Experimental realization of universal quantum gates and six-qubit state using photonic quantum walk [2.331828779757202]
  We report the experimental realize of universal set of quantum gates using photonic quantum walk. We encode multiple qubits using polarization and paths degree of freedom for photon and demonstrate realization of universal set of gates with 100% success probability. This work marks a significant progress towards using photonic quantum walk for quantum computing.
  arXiv  Detail & Related papers  (2024-03-11T12:32:22Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Diamond-shaped quantum circuit for real-time quantum dynamics in one dimension [0.0]
  We show that quantum many-body states can be universally represented using a quantum circuit comprising multi-qubit gates. We also evaluate the efficiency of a quantum circuit constructed with two-qubit gates in quench dynamics for the transverse-field Ising model. Our results reveal that a diamond-shaped quantum circuit, designed to approximate the multi-qubit gate-based quantum circuit, remarkably excels in accurately representing the long-time dynamics of the system.
  arXiv  Detail & Related papers  (2023-11-10T07:07:54Z)
• State preparation by shallow circuits using feed forward [0.0]
  We make use of this four-step scheme not to carry out fault-tolerant computations, but to enhance short, constant-depth, quantum circuits. We show that LAQCC circuits can create long-ranged interactions, which constant-depth quantum circuits cannot achieve. We create three new state preparation protocols for a uniform superposition over an arbitrary number of states.
  arXiv  Detail & Related papers  (2023-07-27T13:20:21Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• 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)
• Gate-Based Circuit Designs For Quantum Adder Inspired Quantum Random Walks on Superconducting Qubits [0.0]
  We examine the viability of implementing Coin Quantum Random Walks using a Quantum Adder based Shift Operator. We focus on the strengths and weaknesses of these walks, particularly circuit depth, gate count, connectivity requirements, and scalability. We present several fidelity results from running our circuits on IBM's quantum volume 32 Toronto' chip, showcasing the extent to which these NISQ devices can currently handle quantum walks.
  arXiv  Detail & Related papers  (2020-12-18T14:34:18Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Generalization of CNOT-based Discrete Circular Quantum Walk: Simulation and Effect of Gate Errors [0.0]
  We show how to implement discrete circular quantum walk in quantum circuits built with universal CNOT and single quit gates. We simulated these circuits on an IBM quantum supercomputer London IBM-Q with 5 qubits.
  arXiv  Detail & Related papers  (2020-05-05T19:21:58Z)

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.