Gate-Based Circuit Designs For Quantum Adder Inspired Quantum Random Walks on Superconducting Qubits

• URL: http://arxiv.org/abs/2012.10268v2
• Date: Thu, 21 Jan 2021 20:50:55 GMT
• Title: Gate-Based Circuit Designs For Quantum Adder Inspired Quantum Random Walks on Superconducting Qubits
• Authors: Daniel Koch, Michael Samodurov, Andrew Projansky, Paul M. Alsing
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum Random Walks, which have drawn much attention over the past few decades for their distinctly non-classical behavior, is a promising subfield within Quantum Computing. Theoretical framework and applications for these walks have seen many great mathematical advances, with experimental demonstrations now catching up. In this study, we examine the viability of implementing Coin Quantum Random Walks using a Quantum Adder based Shift Operator, with quantum circuit designs specifically for superconducting qubits. We focus on the strengths and weaknesses of these walks, particularly circuit depth, gate count, connectivity requirements, and scalability. We propose and analyze a novel approach to implementing boundary conditions for these walks, demonstrating the technique explicitly in one and two dimensions. And finally, 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.

Related papers

• Robust Implementation of Discrete-time Quantum Walks in Any Finite-dimensional Quantum System [2.646968944595457]
  discrete-time quantum walk (DTQW) model one of most suitable choices for circuit implementation. In this paper, we have successfully cut down the circuit cost concerning gate count and circuit depth by half. For the engineering excellence of our proposed approach, we implement DTQW in any finite-dimensional quantum system with akin efficiency.
  arXiv  Detail & Related papers  (2024-08-01T13:07:13Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Quantum Proof of Work with Parametrized Quantum Circuits [0.0]
  There is still a dearth of practical applications for quantum computers with a small number of noisy qubits. We proposed a scheme for quantum-computer compatible proof of work (cryptographic mechanism used in Bitcoin mining) and verified it on a 4-qubit superconducting quantum node.
  arXiv  Detail & Related papers  (2022-04-22T11:26:16Z)
• Fast quantum state transfer and entanglement for cavity-coupled many qubits via dark pathways [1.8352113484137624]
  Quantum state transfer (QST) and entangled state generation (ESG) are important building blocks for modern quantum information processing. We propose a general method to realize high-fidelity fast QST and ESG in a cavity-coupled many qubits system via its dark pathways.
  arXiv  Detail & Related papers  (2022-01-18T08:29:35Z)
• 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)
• Experimental Quantum Generative Adversarial Networks for Image Generation [93.06926114985761]
  We experimentally achieve the learning and generation of real-world hand-written digit images on a superconducting quantum processor. Our work provides guidance for developing advanced quantum generative models on near-term quantum devices.
  arXiv  Detail & Related papers  (2020-10-13T06:57:17Z)
• 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 circuits for the realization of equivalent forms of one-dimensional discrete-time quantum walks on near-term quantum hardware [1.400804591672331]
  Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. We present different forms of discrete-time quantum walks (DTQWs) and show their equivalence for physical realizations.
  arXiv  Detail & Related papers  (2020-01-30T07:29:29Z)

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.