Unitary Coined Discrete-Time Quantum Walks on Directed Multigraphs

• URL: http://arxiv.org/abs/2304.01582v1
• Date: Tue, 4 Apr 2023 07:19:55 GMT
• Title: Unitary Coined Discrete-Time Quantum Walks on Directed Multigraphs
• Authors: Allan Wing-Bocanegra and Salvador E. Venegas-Andraca
• Abstract summary: 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.
• Score: 1.2183405753834557
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Unitary Coined Discrete-Time Quantum Walks (UC-DTQW) constitute a universal model of quantum computation, meaning that any computation done by a general purpose quantum computer can either be done using the UC-DTQW framework. In the last decade,s great progress has been done in this field by developing quantum walk-based algorithms that can outperform classical ones. However, current quantum computers work based on the quantum circuit model of computation, and the general mapping from one model to the other is still an open problem. In this work we provide a matrix analysis of the unitary evolution operator of UC-DTQW, which is composed at the time of two unitary operators: the shift and coin operators. We conceive the shift operator of the system as the unitary matrix form of the adjacency matrix associated to the graph on which the UC-DTQW takes place, and provide a set of equations to transform the latter into the former and vice-versa. However, this mapping modifies the structure of the original graph into a directed multigraph, by splitting single edges or arcs of the original graph into multiple arcs. Thus, the fact that any unitary operator has a quantum circuit representation means that any adjacency matrix that complies with the transformation equations will be automatically associated to a quantum circuit, and any quantum circuit acting on a bipartite system will be always associated to a multigraph. Finally, we extend the definition of the coin operator to a superposition of coins in such a way that each coin acts on different vertices of the multigraph on which the quantum walk takes place, and provide a description of how this can be implemented in circuit form.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Towards Quantum Computational Mechanics [1.530480694206666]
  We show how quantum computing can be used to solve representative element volume (RVE) problems in computational homogenisation. Our quantum RVE solver attains exponential acceleration with respect to classical solvers.
  arXiv  Detail & Related papers  (2023-12-06T12:53:02Z)
• Circuit Implementation of Discrete-Time Quantum Walks via the Shunt Decomposition Method [1.2183405753834557]
  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.
  arXiv  Detail & Related papers  (2023-04-04T03:20:55Z)
• Implementation of Continuous-Time Quantum Walks on Quantum Computers [0.0]
  Quantum walks are interesting candidates to be implemented on quantum computers. We describe efficient circuits that implement the evolution operator of continuous-time quantum-walk-based search algorithms on three graph classes.
  arXiv  Detail & Related papers  (2022-12-17T14:59:21Z)
• Quantum State Preparation and Non-Unitary Evolution with Diagonal Operators [0.0]
  We present a dilation based algorithm to simulate non-unitary operations on unitary quantum devices. We use this algorithm to prepare random sub-normalized two-level states on a quantum device with high fidelity. We also present the accurate non-unitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude damping channel computed on a quantum device.
  arXiv  Detail & Related papers  (2022-05-05T17:56:41Z)
• Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
  We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit. The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$. We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
  arXiv  Detail & Related papers  (2021-12-29T12:33:41Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• 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)
• 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)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.