Generalization of CNOT-based Discrete Circular Quantum Walk: Simulation and Effect of Gate Errors

• URL: http://arxiv.org/abs/2005.02447v1
• Date: Tue, 5 May 2020 19:21:58 GMT
• Title: Generalization of CNOT-based Discrete Circular Quantum Walk: Simulation and Effect of Gate Errors
• Authors: Iyed Ben Slimen and Amor Gueddana and Vasudevan Lakshminarayanan
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the counterparts of random walk in universal quantum computing and their implementation using standard quantum circuits. Quantum walk have been recently well investigated for traversing graphs with certain oracles. We focus our study on traversing a 1-D graph, namely a circle, and show how to implement discrete circular quantum walk in quantum circuits built with universal CNOT and single quit gates. We review elementary quantum gates and circuit decomposition and propose a a generalized version of the all CNOT based quantum discrete circular walk. We simulated these circuits on an IBM quantum supercomputer London IBM-Q with 5 qubits. This quantum computer has non perfect gates based on superconducting qubits, therefore we analyze the impact of errors on the fidelity of the Walker circuit.

Related papers

• Full Quantum Process Tomography of a Universal Entangling Gate on an IBM's Quantum Computer [0.0]
  We conduct a thorough analysis of the SQSCZ gate, a universal two-qubit entangling gate, using real quantum hardware. Our analysis unveils commendable fidelities and noise properties of the SQSCZ gate, with process fidelities reaching $97.27098%$ and $88.99383%$, respectively.
  arXiv  Detail & Related papers  (2024-02-10T13:25:01Z)
• 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)
• 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)
• Qualitative quantum simulation of resonant tunneling and localization with the shallow quantum circuits [0.0]
  In a circuit-based quantum computer, the computing is performed via the discrete-time evolution driven by quantum gates. We show that shallow quantum circuits are sufficient to qualitatively observe some typical quantum phenomena in the continuous-time evolution limit.
  arXiv  Detail & Related papers  (2023-02-07T04:21:38Z)
• Gaussian initializations help deep variational quantum circuits escape from the barren plateau [87.04438831673063]
  Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years. However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number. This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
  arXiv  Detail & Related papers  (2022-03-17T15:06:40Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Sample Complexity of Learning Quantum Circuits [4.329298109272386]
  We prove that physical quantum circuits are PAC learnable on a quantum computer via empirical risk minimization. Our results provide a valuable guide for quantum machine learning in both theory and experiment.
  arXiv  Detail & Related papers  (2021-07-19T18:00:04Z)
• 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)

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.