• Corpus ID: 15824203

Span-program-based quantum algorithm for the rank problem

  title={Span-program-based quantum algorithm for the rank problem},
  author={Aleksandrs Belovs},
Recently, span programs have been shown to be equivalent to quantum query algorithms. It is an open problem whether this equivalence can be utilized in order to come up with new quantum algorithms. We address this problem by providing span programs for some linear algebra problems. We develop a notion of a high level span program, that abstracts from loading input vectors into a span program. Then we give a high level span program for the rank problem. The last section of the paper deals with… 

Figures and Tables from this paper

Span Programs are Equivalent to Quantum Query Algorithms

It is proved that for any boolean function, the optimal “witness size” of a span program equals the general adversary bound, therefore, span program witness size and quantum query complexity are equivalent measures.

Span-Program-Based Quantum Algorithms for Graph Bipartiteness and Connectivity

Given a query access to the adjacency matrix of a simple graph G with n vertices, this work provides two new span-program-based quantum algorithms that provide an algorithm for testing if the graph is bipartite that uses $$On\sqrt{n}$$ quantum queries.

Span-Program-Based Quantum Algorithms for Graph Bipartiteness and Connectivity

Given a query access to the adjacency matrix of a simple graph with vertices, this work provides two new span-program-based quantum algorithms: an algorithm for testing if the graph is bipartite that uses $O(n\sqrt{n})$ quantum queries; an algorithmFor testing ifThe graph is connected that uses O(n(n)(n)} quantum queries.

Span-program-based quantum algorithm for tree detection

This paper presents a time-efficient span-program-based quantum algorithm for the subgraph/not-a-minor problem for $T, and shows that this problem can be solved by a bounded-error quantum algorithm with $O(n)$ query complexity and time complexity.

Span programs for functions with constant-sized 1-certificates: extended abstract

The power of the approach is proved by designing a quantum algorithm for the triangle problem with query complexity O(n35/27) that is better than O( n13/10) of the best previously known algorithm by Magniez et al.

Quantum Algorithm for k-distinctness with Prior Knowledge on the Input

The learning graph technique from arXiv:1105.4024 is used to give a quantum algorithm for k-distinctness problem that runs in o(n^{3/4})$ queries, for a fixed $k$, given some prior knowledge on the structure of the input.

Span program for non-binary functions

It is concluded that non-binary span programs characterize the quantum query complexity of f up to a factor of order at most $\sqrt{\ell-1}$ and this factor cannot be improved.

Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes

  • H. Lipmaa
  • Computer Science
    IACR Cryptol. ePrint Arch.
  • 2013
A new linear PCP is proposed for the Circuit-SAT, based on a combination of standard span programs that verify the correctness of every individual gate and high-distance linear error-correcting codes that check the consistency of wire assignments.

Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness

Space and time efficient quantum algorithms for deciding the two properties in the adjacency array model are described, which run in time $\tilde{O}(n\sqrt{d_m})$ and also require $O(\log n)$ space, where d_m$ is the maximum degree of any vertex in the input graph.

Span Programs, Electrical Flows, and Beyond: New Approaches to Quantum Algorithms

This dissertation explores several new approaches to developing quantum algorithms, including span programs, electrical flows and nonsparse Hamiltonian simulation, and gives two quantum algorithms for approximating the effective resistance between two given vertices in an electrical network.



Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function

  • B. Reichardt
  • Computer Science
    2009 50th Annual IEEE Symposium on Foundations of Computer Science
  • 2009
It is generally that properties of eigenvalue-zero eigenvectors in fact imply an "effective" spectral gap around zero, and a strong universality result for span programs follows.

Reflections for quantum query algorithms

We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently

Span-program-based quantum algorithm for evaluating formulas

A quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority), generalizes the optimal quantum AND-OR formula evaluation algorithm and is optimal for evaluating the balanced ternary majority formula.


A bounded-error quantum algorithm that solves the problem of evaluating an AND-OR formula on an N-bit black-box input in time N1/2+o(1) and in particular, approximately balanced formulas can be evaluated in O( √ N) queries, which is optimal.

A fast quantum mechanical algorithm for database search

In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .

Tight bounds on quantum searching

A lower bound on the efficiency of any possible quantum database searching algorithm is provided and it is shown that Grover''s algorithm nearly comes within a factor 2 of being optimal in terms of the number of probes required in the table.

A Quantum Algorithm for the Hamiltonian NAND Tree

A quantum algorithm for the binary NAND tree problem in the Hamil- tonian oracle model using a continuous time quantum walk with a running time proportional to p N is given.

Negative weights make adversaries stronger

A stronger version of the adversary method which goes beyond this principle to make explicit use of the stronger condition that the algorithm actually computes the function, and which is a lower bound on bounded-error quantum query complexity.

Quantum measurements and the Abelian Stabilizer Problem

  • A. Kitaev
  • Mathematics
    Electron. Colloquium Comput. Complex.
  • 1996
A polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm is presented, based on a procedure for measuring an eigenvalue of a unitary operator.

Quantum speed-up of Markov chain based algorithms

  • M. Szegedy
  • Computer Science
    45th Annual IEEE Symposium on Foundations of Computer Science
  • 2004
It is shown that under certain conditions, the quantum version of the Markov chain gives rise to a quadratic speed-up, and that the quantum escape time, just like its classical version, depends on the spectral properties of the transition matrix with the marked rows and columns deleted.