A Generalisation of the Phase Kick-Back

• URL: http://arxiv.org/abs/2207.02580v1
• Date: Wed, 6 Jul 2022 10:53:02 GMT
• Title: A Generalisation of the Phase Kick-Back
• Abstract summary: We present a generalisation of the Phase Kick-Back technique, which is central to some of the classical algorithms in quantum computing. We will begin by recalling the Phase Kick-Back technique to then introduce the new generalised version and analyse it. We will present a generalised version of the Bernstein-Vazirani problem and solve it using this technique to better understand its inner workings.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we present a generalisation of the Phase Kick-Back technique, which is central to some of the classical algorithms in quantum computing, such as the Deutsch--Jozsa algorithm, Simon's algorithm or Grover's algorithm. We will begin by recalling the Phase Kick-Back technique to then introduce the new generalised version and analyse it. After that, we will present a new generalised version of the Deutsch--Jozsa problem and it will be solved using the previously defined technique. Finally, we will present a generalised version of the Bernstein-Vazirani problem and solve it using this technique to better understand its inner workings.

Related papers

• Federated stochastic bilevel optimization with fully first-order gradients [57.1147486991903]
  Federated matrices bilevel optimization has been actively studied in recent years due to its widespread applications in machine learning.<n>Most existing federated bilevel optimization algorithms require the computation of second-order Hessian and Jacobian matrices.<n>We propose a novel federated convergence variance-reduced bilevel descent algorithm that relies solely on first-order oracles.
  arXiv  Detail & Related papers  (2026-09-14T21:12:59Z)
• On the History of the Square and Multiply Algorithm [0.0]
  The square-and-multiply algorithm, also known as binary exponentiation or repeated squaring, is a technique for fast exponentiation commonly used in modern cryptography and computational number theory.<n>This paper critically examines the origins and formalization of the algorithm through primary source analysis.
  arXiv  Detail & Related papers  (2026-05-31T02:17:36Z)
• Randomized and quantum approximate matrix multiplication [0.718791111462057]
  A long line of literature considers randomized algorithms, which return an approximate solution in faster time.<n>We first give refined analyses of classical algorithms based on random walks by Cohen-Lewis (99), and based on sketching by Sarl'os (06) and Drineas-Kannan-Mahoney (06)<n>We then propose an improvement on Cohen-Lewis that yields a single classical algorithm that is faster than all the other approaches.
  arXiv  Detail & Related papers  (2025-10-09T17:44:03Z)
• The Differentiable Feasibility Pump [49.55771920271201]
  This paper shows that the traditional feasibility pump and many of its follow-ups can be seen as gradient-descent algorithms with specific parameters. A central aspect of this reinterpretation is observing that the traditional algorithm differentiates the solution of the linear relaxation with respect to its cost.
  arXiv  Detail & Related papers  (2024-11-05T22:26:51Z)
• Bregman-divergence-based Arimoto-Blahut algorithm [53.64687146666141]
  We generalize the Arimoto-Blahut algorithm to a general function defined over Bregman-divergence system. We propose a convex-optimization-free algorithm that can be applied to classical and quantum rate-distortion theory.
  arXiv  Detail & Related papers  (2024-08-10T06:16:24Z)
• Further Applications of the Generalised Phase Kick-Back [0.0]
  In our previous work, we defined a quantum algorithmic technique known as the Generalised Phase Kick-Back, or $GPK$. This paper defines the concept of $mathbfy$-balanced functions and solves a new problem, which further generalises the generalised Deutsch-Jozsa problem.
  arXiv  Detail & Related papers  (2024-05-06T20:56:13Z)
• A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms [1.1470070927586018]
  The manuscript covers in a simple way classical algorithms for solving the Maximum Clique Problem. The review concludes with benchmarks for testing classical as well as new learning, and quantum algorithms.
  arXiv  Detail & Related papers  (2024-03-13T20:12:05Z)
• Introduction to Variational Quantum Algorithms [0.0]
  It provides an explanation of the basic variational algorithms, such as Variational Quantum Eigensolver (VQE) and Quantum Approximate Algorithm Optimization (QAOA) It also describes some more advanced techniques that can be used to make these algorithms more efficient, as well as the challenges associated with using them.
  arXiv  Detail & Related papers  (2024-02-24T18:14:13Z)
• Experimentally demonstrating indefinite causal order algorithms to solve the generalized Deutsch's problem [4.555392897705548]
  Deutsch's algorithm is the first quantum algorithm to show the advantage over the classical algorithm. We propose a new quantum algorithm with indefinite causal order to solve this problem.
  arXiv  Detail & Related papers  (2023-05-09T13:04:28Z)
• Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints [117.8317521974783]
  We consider non-clairvoyant scheduling with online precedence constraints. An algorithm is oblivious to any job dependencies and learns about a job only if all of its predecessors have been completed.
  arXiv  Detail & Related papers  (2023-01-30T13:17:15Z)
• Basic Quantum Algorithms [0.0]
  Quantum computing is evolving so rapidly that it forces us to revisit, rewrite, and update the foundations of the theory. Basic Quantum Algorithms revisits the earliest quantum algorithms.
  arXiv  Detail & Related papers  (2022-01-25T19:00:10Z)
• Bregman divergence based em algorithm and its application to classical and quantum rate distortion theory [61.12008553173672]
  We address the minimization problem of the Bregman divergence between an exponential subfamily and a mixture subfamily in a Bregman divergence system. We apply this algorithm to rate distortion and its variants including the quantum setting.
  arXiv  Detail & Related papers  (2022-01-07T13:33:28Z)
• Deep Algorithm Unrolling for Biomedical Imaging [99.73317152134028]
  In this chapter, we review biomedical applications and breakthroughs via leveraging algorithm unrolling. We trace the origin of algorithm unrolling and provide a comprehensive tutorial on how to unroll iterative algorithms into deep networks. We conclude the chapter by discussing open challenges, and suggesting future research directions.
  arXiv  Detail & Related papers  (2021-08-15T01:06:26Z)
• Evolving Reinforcement Learning Algorithms [186.62294652057062]
  We propose a method for meta-learning reinforcement learning algorithms. The learned algorithms are domain-agnostic and can generalize to new environments not seen during training. We highlight two learned algorithms which obtain good generalization performance over other classical control tasks, gridworld type tasks, and Atari games.
  arXiv  Detail & Related papers  (2021-01-08T18:55:07Z)

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.