Three-qubit Deutsch-Jozsa in measurement-based quantum computing
- URL: http://arxiv.org/abs/2306.13372v3
- Date: Mon, 11 Sep 2023 11:13:44 GMT
- Title: Three-qubit Deutsch-Jozsa in measurement-based quantum computing
- Authors: M. Schwetz and R. M. Noack
- Abstract summary: Measurement-based quantum computing (MBQC) is an alternate paradigm for formulating quantum algorithms.
We describe and apply a general scheme for reformulating quantum circuits as MBQC implementations.
We derive a ZX graph-diagram that encodes a general MBQC implementation for the three-qubit Deutsch-Jozsa algorithm.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Measurement-based quantum computing (MBQC), an alternate paradigm for
formulating quantum algorithms, can lead to potentially more flexible and
efficient implementations as well as to theoretical insights on the role of
entanglement in a quantum algorithm. Using the graph-theoretical ZX-calculus,
we describe and apply a general scheme for reformulating quantum circuits as
MBQC implementations. After illustrating the method using the two-qubit
Deutsch-Jozsa algorithm, we derive a ZX graph-diagram that encodes a general
MBQC implementation for the three-qubit Deutsch-Jozsa algorithm. This graph
describes an 11-qubit cluster state on which single-qubit measurements are used
to execute the algorithm. Particular sets of choices of the axes for the
measurements can be used to implement any realization of the oracle. In
addition, we derive an equivalent lattice cluster state for the algorithm.
Related papers
- Simon algorithm in measurement-based quantum computing [0.0]
Simon's subgroup hidden algorithm was the first quantum algorithm to prove the superiority of quantum computing over classical computing.
We present a reformulation of the Simon algorithm into the language of measurement-based quantum computing.
We show that the $n$-qubit version of the Simon algorithm can be formulated in MBQC as cluster state graph with $2n$ nodes and $n2$ edges.
arXiv Detail & Related papers (2024-05-28T13:02:54Z) - The Algorithm for Solving Quantum Linear Systems of Equations With Coherent Superposition and Its Extended Applications [8.8400072344375]
We propose two quantum algorithms for solving quantum linear systems of equations with coherent superposition.
The two quantum algorithms can both compute the rank and general solution by one measurement.
Our analysis indicates that the proposed algorithms are mainly suitable for conducting attacks against lightweight symmetric ciphers.
arXiv Detail & Related papers (2024-05-11T03:03:14Z) - 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) - Two quantum algorithms for solving the one-dimensional
advection-diffusion equation [0.0]
Two quantum algorithms are presented for the numerical solution of a linear one-dimensional advection-diffusion equation with periodic boundary conditions.
Their accuracy and performance with increasing qubit number are compared point-by-point with each other.
arXiv Detail & Related papers (2023-12-30T21:23:15Z) - Generalized quantum Arimoto-Blahut algorithm and its application to
quantum information bottleneck [55.22418739014892]
We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al.
We apply our algorithm to the quantum information bottleneck with three quantum systems.
Our numerical analysis shows that our algorithm is better than their algorithm.
arXiv Detail & Related papers (2023-11-19T00:06:11Z) - Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
We design, implement, and evaluate three hybrid quantum k-Means algorithms.
We exploit quantum phenomena to speed up the computation of distances.
We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
arXiv Detail & Related papers (2022-12-13T16:04:16Z) - Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages.
The computation can then be implemented using a series of non-Pauli measurements on this graph state.
arXiv Detail & Related papers (2022-09-15T14:52:31Z) - Equivalence Checking of Quantum Circuits with the ZX-Calculus [3.610459670994051]
State-of-the-art quantum computers are capable of running increasingly complex algorithms.
The need for automated methods to design and test potential applications rises.
Recently, new methods have been proposed that tackle this problem.
arXiv Detail & Related papers (2022-08-26T18:00:01Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - 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)
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.