Circuit Implementation of Discrete-Time Quantum Walks via the Shunt Decomposition Method

• URL: http://arxiv.org/abs/2304.01501v1
• Date: Tue, 4 Apr 2023 03:20:55 GMT
• Title: Circuit Implementation of Discrete-Time Quantum Walks via the Shunt Decomposition Method
• Authors: Allan Wing-Bocanegra and Salvador E. Venegas-Andraca
• Abstract summary: In this paper, we analyze the mapping process of block diagonal operators into quantum circuit form. The obtained circuits are then executed on quantum processors of the type Falcon r5.11L and Falcon r4T.
• Score: 1.2183405753834557
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Several models have been proposed to build evolution operators to perform quantum walks in a theoretical way, although when wanting to map the resulting evolution operators into quantum circuits to run them in quantum computers, it is often the case that the mapping process is in fact complicated. Nevertheless, when the adjacency matrix of a graph can be decomposed into a sum of permutation matrices, we can always build a shift operator for a quantum walk that has a block diagonal matrix representation. In this paper, we analyze the mapping process of block diagonal operators into quantum circuit form, and apply this method to obtain quantum circuits that generate quantum walks on the most common topologies found in the literature: the straight line, the cyclic graph, the hypercube and the complete graph. The obtained circuits are then executed on quantum processors of the type Falcon r5.11L and Falcon r4T (two of each type) through IBM Quantum Composer platform and on the Qiskit Aer simulator, performing three steps for each topology. The resulting distributions were compared against analytical distributions, using the statistical distance $\ell_1$ as a performance metric. Regarding experimental executions, we obtained short $\ell_1$ distances in the cases of quantum circuits with a low amount of multi-control gates, being the quantum processors of the type Falcon r4T the ones that provided more accurate results.

Related papers

• Efficient implementation of discrete-time quantum walks on quantum computers [0.0]
  We propose an efficient and scalable quantum circuit implementing the discrete-time quantum walk (DTQW) model. For $t$ time-steps of the DTQW, the proposed circuit requires only $O(n2 + nt)$ two-qubit gates compared to the $O(n2 t)$ of the current most efficient implementation.
  arXiv  Detail & Related papers  (2024-02-02T19:11:41Z)
• Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity [1.0360348400670518]
  We show that a minimal SWAP-gate count for executing a quantum circuit on a device emerges via the minimization of the distance between quantum states. This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing.
  arXiv  Detail & Related papers  (2024-02-01T10:32:05Z)
• Symmetry-Based Quantum Circuit Mapping [2.51705778594846]
  We introduce a quantum circuit remapping algorithm that leverages the intrinsic symmetries in quantum processors. This algorithm identifies all topologically equivalent circuit mappings by constraining the search space using symmetries and accelerates the scoring of each mapping using vector computation.
  arXiv  Detail & Related papers  (2023-10-27T10:04:34Z)
• Unitary Coined Discrete-Time Quantum Walks on Directed Multigraphs [1.2183405753834557]
  Unitary Coined Discrete-Time Quantum Walks (UC-DTQW) constitute a universal model of quantum computation. Current quantum computers work based on the quantum circuit model of computation.
  arXiv  Detail & Related papers  (2023-04-04T07:19:55Z)
• 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)
• Gradient-descent quantum process tomography by learning Kraus operators [63.69764116066747]
  We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems. We use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators. The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes.
  arXiv  Detail & Related papers  (2022-08-01T12:48:48Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• 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)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.