Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0111146 · Physical Review A

Majorization arrow in quantum-algorithm design

José Ignacio Latorre, Miguel Angel Martin-Delgado

Published Aug 9, 2002• 34 citations
arXivHTMLPDF

Abstract

We apply majorization theory to study the quantum algorithms known so far and find that there is a majorization principle underlying the way they operate. Grover's algorithm is a neat instance of this principle where majorization works step by step until the optimal target state is found. Extensions of this situation are also found in algorithms based in quantum adiabatic evolution and the family of quantum phase-estimation algorithms, including Shor's algorithm. We state that in quantum algorithms the time arrow is a majorization arrow.

DOI
10.1103/physreva.66.022305

Related papers

Majorization in quantum adiabatic algorithms

Zhaohui Wei, Zhengfeng Ji, Mingsheng Ying

The majorization theory has been applied to analyze the mathematical structure of quantum algorithms. An empirical conclusion by numerical simulations obtained in the previous literature indicates that step-by-step majorization seems to appear universally in quantum adiabatic algorithms. In this paper, a rigorous analysis of the majorization arrow in a special class of quantum adiabatic algorithms is carried out. In particular, we prove that for any adiabatic algorithm of this class, step-by-step majorization of the ground state holds exactly. For the actual state, we show that step-by-step majorization holds approximately, and furthermore that the longer the running time of the algorithm, the better the approximation.

arXiv:quant-ph/0606015•Physical Review A•Oct 18, 2006•1 citation

Majorization in General Grover's Algorithms: Efficient vs Non-efficient cases

Fernando Martínez García

We study the characterisation of efficient and non-efficient families of Grover's algorithms according to the majorization principle. We develop a geometrical interpretation based on the parameters that appears on these algorithms. Using this interpretation we observe a step-by-step majorization in all efficient Grover's algorithms, whereas the non-efficient Grover's algorithms fail to abide by this majorization principle. These Majorization results are first obtained from numerical calculations. Motivated by these numerical results, we also obtained an analytical demonstration. Finally, the geometrical interpretation found for these parameters is used to obtain additional results of Grover's algorithms that improves our understanding of how they work.

arXiv:1806.04272•Jun 8, 2018•2 citations

Some Quantum Algorithms

Daniel D. Stancil, Gregory T. Byrd

In this chapter, the authors present a few selected quantum algorithms that illustrate the promise of quantum computers to provide a computational advantage over classical computers. They briefly discuss computational complexity and how it applies to quantum computing. The authors present the two most famous quantum algorithms which promise quantum advantage: Grover's search algorithm and Shor's algorithm for factoring. They introduce several fundamental building blocks, including amplitude amplification, the Quantum Fourier Transform, and quantum phase estimation. Finally, the authors discuss a class of hybrid classical-quantum algorithms, known as variational algorithms, that are designed to operate within the realm of noisy, intermediate-scale quantum (NISQ) systems that are likely to be prevalent in the early years of quantum applications. Since quantum hardware has become publically available, a major effort has emerged to find algorithms that are suitable for addressing practical problems on near-term NISQ machines.

Wiley eBooks•Apr 5, 2022•0 citations

Evolution of Quantum Computing Based on Grover's Search Algorithm

Prakhar Shrivastava, Kapil Kumar Soni, Akhtar Rasool

Quantum computing introduces an efficient way for unfolding complex problems on computing systems. It uses concept of superposition and entanglement, & hence supports intrinsic parallelism for obtaining the speedup in context of time over classical computing. Quantum algorithms can be efficiently implemented over quantum computing system. Most popular quantum algorithms like Grover's and Shor's provide a great foundation to specifically design the algorithms. These algorithms work on improving the lower runtime bounds of classical algorithms. Grover's algorithm exhibits a quadratic polynomial speedup while searching an element among `N' elements unstructured database. The algorithmic strategy can be applied over various computer science related applications and some important are being considered in this article i.e. pattern matching, data mining and machine learning. This article explores quantum fundamentals; history based evolution followed by Grover's search algorithm in detail with cascading advantages, limitations & applications and also finally concludes with the significance of quantum computing & quantum algorithmic domains.

International Conference on Computing, Communication and Networking Technologies (ICCCNT)•Jul 1, 2019•22 citations

An adiabatic oracle for Grover's algorithm

Bin Yan, Nikolai A. Sinitsyn

Grover's search algorithm was originally proposed for circuit-based quantum computers. A crucial part of it is to query an oracle -- a black-box unitary operation. Generation of this oracle is formally beyond the original algorithm design. Here, we propose a realization of Grover's oracle for a large class of searching problems using a quantum annealing step. The time of this step grows only logarithmically with the size of the database. This suggests an efficient path to application of Grover's algorithm to practically important problems, such as finding the ground state of a Hamiltonian with a spectral gap over its ground state.

arXiv:2207.05665•Jul 12, 2022•5 citations

Quantum search algorithm by adiabatic evolution under a priori probability

Zhaohui Wei, Mingsheng Ying

Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum algorithms, including Grover's algorithm. In this paper, we show that quantum search algorithm by adiabatic evolution has two properties that conventional quantum search algorithm doesn't have. Firstly, we show that in the initial state of the algorithm only the amplitude of the basis state corresponding to the solution affects the running time of the algorithm, while other amplitudes do not. Using this property, if we know a priori probability about the location of the solution before search, we can modify the adiabatic evolution to make the algorithm faster. Secondly, we show that by a factor for the initial and finial Hamiltonians we can reduce the running time of the algorithm arbitrarily. Especially, we can reduce the running time of adiabatic search algorithm to a constant time independent of the size of the database. The second property can be extended to other adiabatic algorithms.

arXiv:quant-ph/0412117•Dec 15, 2004•6 citations
We apply majorization theory to study the quantum algorithms known so far and find that there is a majorization principle underlying the way they operate. Grover's algorithm is a neat instance of this principle where majorization works step by step until the optimal target state is found. Extensions of this situation are also found in algorithms based in quantum adiabatic evolution and the family of quantum phase-estimation algorithms, including Shor's algorithm. We state that in quantum algorithms the time arrow is a majorization arrow.
The majorization theory has been applied to analyze the mathematical structure of quantum algorithms. An empirical conclusion by numerical simulations obtained in the previous literature indicates that step-by-step majorization seems to appear universally in quantum adiabatic algorithms. In this paper, a rigorous analysis of the majorization arrow in a special class of quantum adiabatic algorithms is carried out. In particular, we prove that for any adiabatic algorithm of this class, step-by-step majorization of the ground state holds exactly. For the actual state, we show that step-by-step majorization holds approximately, and furthermore that the longer the running time of the algorithm, the better the approximation.
We study the characterisation of efficient and non-efficient families of Grover's algorithms according to the majorization principle. We develop a geometrical interpretation based on the parameters that appears on these algorithms. Using this interpretation we observe a step-by-step majorization in all efficient Grover's algorithms, whereas the non-efficient Grover's algorithms fail to abide by this majorization principle. These Majorization results are first obtained from numerical calculations. Motivated by these numerical results, we also obtained an analytical demonstration. Finally, the geometrical interpretation found for these parameters is used to obtain additional results of Grover's algorithms that improves our understanding of how they work.
In this chapter, the authors present a few selected quantum algorithms that illustrate the promise of quantum computers to provide a computational advantage over classical computers. They briefly discuss computational complexity and how it applies to quantum computing. The authors present the two most famous quantum algorithms which promise quantum advantage: Grover's search algorithm and Shor's algorithm for factoring. They introduce several fundamental building blocks, including amplitude amplification, the Quantum Fourier Transform, and quantum phase estimation. Finally, the authors discuss a class of hybrid classical-quantum algorithms, known as variational algorithms, that are designed to operate within the realm of noisy, intermediate-scale quantum (NISQ) systems that are likely to be prevalent in the early years of quantum applications. Since quantum hardware has become publically available, a major effort has emerged to find algorithms that are suitable for addressing practical problems on near-term NISQ machines.
Quantum computing introduces an efficient way for unfolding complex problems on computing systems. It uses concept of superposition and entanglement, & hence supports intrinsic parallelism for obtaining the speedup in context of time over classical computing. Quantum algorithms can be efficiently implemented over quantum computing system. Most popular quantum algorithms like Grover's and Shor's provide a great foundation to specifically design the algorithms. These algorithms work on improving the lower runtime bounds of classical algorithms. Grover's algorithm exhibits a quadratic polynomial speedup while searching an element among `N' elements unstructured database. The algorithmic strategy can be applied over various computer science related applications and some important are being considered in this article i.e. pattern matching, data mining and machine learning. This article explores quantum fundamentals; history based evolution followed by Grover's search algorithm in detail with cascading advantages, limitations & applications and also finally concludes with the significance of quantum computing & quantum algorithmic domains.
Grover's search algorithm was originally proposed for circuit-based quantum computers. A crucial part of it is to query an oracle -- a black-box unitary operation. Generation of this oracle is formally beyond the original algorithm design. Here, we propose a realization of Grover's oracle for a large class of searching problems using a quantum annealing step. The time of this step grows only logarithmically with the size of the database. This suggests an efficient path to application of Grover's algorithm to practically important problems, such as finding the ground state of a Hamiltonian with a spectral gap over its ground state.
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum algorithms, including Grover's algorithm. In this paper, we show that quantum search algorithm by adiabatic evolution has two properties that conventional quantum search algorithm doesn't have. Firstly, we show that in the initial state of the algorithm only the amplitude of the basis state corresponding to the solution affects the running time of the algorithm, while other amplitudes do not. Using this property, if we know a priori probability about the location of the solution before search, we can modify the adiabatic evolution to make the algorithm faster. Secondly, we show that by a factor for the initial and finial Hamiltonians we can reduce the running time of the algorithm arbitrarily. Especially, we can reduce the running time of adiabatic search algorithm to a constant time independent of the size of the database. The second property can be extended to other adiabatic algorithms.