An alternative explicit circuit diagram for the quantum search algorithm by implementing a non-unitary gate

• URL: http://arxiv.org/abs/2412.16514v5
• Date: Mon, 10 Mar 2025 17:39:10 GMT
• Title: An alternative explicit circuit diagram for the quantum search algorithm by implementing a non-unitary gate
• Authors: Ammar Daskin,
• Abstract summary: Since the final quantum state in the Grover search algorithm is the normalized marked quantum state from the Gram-Schmidt process, we can generate this vector by using a non-unitary gate.<n>We present multiple explicit unitary implementations by using the square root of the non-unitary matrix and by a unitary matrix that mimics the Gram-Schmidt process.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Since the final quantum state in the Grover search algorithm is the normalized marked quantum state from the Gram-Schmidt process, Abrams and Lloyd[1] has shown that we can generate this vector by using a non-unitary gate. Following their ideas, in this paper, we present multiple explicit unitary implementations by using the square root of the non-unitary matrix and by a unitary matrix that mimics the Gram-Schmidt process. We also discuss the implementation through a linear combination of unitary matrices or similar methods and how these approximations may change the complexity. The reading of the marked element from the given circuits with high probability still requires multiple repetitions similar to the original algorithm. However, it gives an alternative implementations which may be useful in certain platforms.

Related papers

• Quantum Hermitian conjugate and encoding unnormalized matrices [49.494595696663524]
  We develop the family of matrix-manipulation algorithms based on the encoding the matrix elements into the probability amplitudes of the pure superposition state of a certain quantum system. We introduce two extensions to these algorithms which allow (i) to perform Hermitian conjugation of matrices under consideration and (ii) to weaken the restriction to the absolute values of matrix elements unavoidably imposed by the normalization condition for a pure quantum state.
  arXiv  Detail & Related papers  (2025-03-27T08:49:59Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  Conditional measurement is involved to avoid small success probability in ancilla measurement. The objective function for the algorithm can be obtained probabilistically via measurement of the state of a one-qubit subsystem.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Decomposition of unitary matrix into quantum gates [0.0]
  An algorithm is proposed to convert arbitrary unitary matrix to a sequence of $X$ gates. This algorithm is used to generate Q# implementation for arbitrary unitary matrix.
  arXiv  Detail & Related papers  (2025-01-14T02:05:38Z)
• Tensor networks based quantum optimization algorithm [0.0]
  In optimization, one of the well-known classical algorithms is power iterations. We propose a quantum realiziation to circumvent this pitfall. Our methodology becomes instance agnostic and thus allows one to address black-box optimization within the framework of quantum computing.
  arXiv  Detail & Related papers  (2024-04-23T13:49:11Z)
• Here comes the SU(N): multivariate quantum gates and gradients [1.7809113449965783]
  Variational quantum algorithms use non-commuting optimization methods to find optimal parameters for a parametrized quantum circuit. Here, we propose a gate which fully parameterizes the special unitary group $mathrm(N) gate. We show that the proposed gate and its optimization satisfy the quantum limit of the unitary group.
  arXiv  Detail & Related papers  (2023-03-20T18:00:04Z)
• Heralded gate search with genetic algorithms for quantum computation [0.0]
  We present genetic algorithms based search technique for the linear optics schemes, performing two-qubit quantum gates. We successfully applied this technique for finding heralded two-qubit gates and obtained the new schemes with performance parameters equal to the best currently known.
  arXiv  Detail & Related papers  (2023-03-10T11:09:13Z)
• Efficient application of the factorized form of the unitary coupled-cluster ansatz for the variational quantum eigensolver algorithm by using linear combination of unitaries [0.0]
  The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons.
  arXiv  Detail & Related papers  (2023-02-17T04:03:06Z)
• One-Way Ticket to Las Vegas and the Quantum Adversary [78.33558762484924]
  We show that quantum Las Vegas query complexity is exactly equal to the quantum adversary bound. This is achieved by transforming a feasible solution to the adversary inversion problem into a quantum query algorithm.
  arXiv  Detail & Related papers  (2023-01-05T11:05:22Z)
• Near-optimal quantum circuit construction via Cartan decomposition [4.900041609957432]
  We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation.
  arXiv  Detail & Related papers  (2022-12-25T17:01:13Z)
• A doubly stochastic matrices-based approach to optimal qubit routing [0.0]
  Swap mapping is a quantum compiler optimization that, by SWAP gates, maps a logical quantum circuit to an equivalent physically implementable one. In this work, we employ a structure called doubly convex matrix, which is defined as a combination of permutation matrices. We show that the proposed algorithm, at the cost of additional time, can deliver significant depth reduction when compared to the state of the art algorithm SABRE.
  arXiv  Detail & Related papers  (2022-11-14T09:25:35Z)
• Automatic and effective discovery of quantum kernels [43.702574335089736]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data. We present a different approach, which employs optimization techniques, similar to those used in neural architecture search and AutoML. The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Alternatives to a nonhomogeneous partial differential equation quantum algorithm [52.77024349608834]
  We propose a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $Apsi(textbfr)=f(textbfr)$. These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.
  arXiv  Detail & Related papers  (2022-05-11T14:29:39Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Sublinear Time Approximation of Text Similarity Matrices [50.73398637380375]
  We introduce a generalization of the popular Nystr"om method to the indefinite setting. Our algorithm can be applied to any similarity matrix and runs in sublinear time in the size of the matrix. We show that our method, along with a simple variant of CUR decomposition, performs very well in approximating a variety of similarity matrices.
  arXiv  Detail & Related papers  (2021-12-17T17:04:34Z)
• Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm [0.8594140167290096]
  Solovay-Kitaev algorithm is a fundamental result in quantum computation. It gives an algorithm for efficiently compiling arbitrary unitaries using universal gate sets. We provide the first inverse-free Solovay-Kitaev algorithm, which makes no assumption on the structure within a gate set beyond universality.
  arXiv  Detail & Related papers  (2021-12-03T17:39:41Z)
• Quantum Algorithms based on the Block-Encoding Framework for Matrix Functions by Contour Integrals [1.5293427903448018]
  We show a framework to implement the linear combination of the inverses on quantum computers. We propose a quantum algorithm for matrix functions based on the framework.
  arXiv  Detail & Related papers  (2021-06-15T12:10:35Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Accelerated Message Passing for Entropy-Regularized MAP Inference [89.15658822319928]
  Maximum a posteriori (MAP) inference in discrete-valued random fields is a fundamental problem in machine learning. Due to the difficulty of this problem, linear programming (LP) relaxations are commonly used to derive specialized message passing algorithms. We present randomized methods for accelerating these algorithms by leveraging techniques that underlie classical accelerated gradient.
  arXiv  Detail & Related papers  (2020-07-01T18:43:32Z)
• Optimal Iterative Sketching with the Subsampled Randomized Hadamard Transform [64.90148466525754]
  We study the performance of iterative sketching for least-squares problems. We show that the convergence rate for Haar and randomized Hadamard matrices are identical, andally improve upon random projections. These techniques may be applied to other algorithms that employ randomized dimension reduction.
  arXiv  Detail & Related papers  (2020-02-03T16:17:50Z)

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.