Quantum algorithms for algebraic problems (Q3077033)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Quantum algorithms for algebraic problems	scientific article

Statements

scholarly article

0 references

Quantum algorithms for algebraic problems (English)

0 references

zbMATH Open document ID

0 references

10.1103/RevModPhys.82.1

0 references

Andrew M. Childs

0 references

0 references

Reviews of Modern Physics

0 references

publication date

21 February 2011

0 references

full work available at URL

https://arxiv.org/abs/0812.0380

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Quantum Computability

0 references

Counting points on curves and Abelian varieties over finite fields

0 references

0 references

Fault-Tolerant Quantum Computation with Constant Error Rate

0 references

A polynomial quantum algorithm for approximating the Jones polynomial

0 references

Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation

0 references

Quantum Walk Algorithm for Element Distinctness

0 references

Fast Monte Carlo algorithms for permutation groups

0 references

Reversing quantum dynamics with near-optimal quantum and classical fidelity

0 references

Quantum lower bounds by polynomials

0 references

Strengths and Weaknesses of Quantum Computing

0 references

0 references

Quantum Complexity Theory

0 references

On the computational complexity of the general discrete Fourier transform

0 references

Noise-tolerant learning, the parity problem, and the statistical query model

0 references

Approximate Counting and Quantum Computation

0 references

A new universal and fault-tolerant quantum basis

0 references

0 references

0 references

Spatial search and the Dirac equation

0 references

Fast generalized Fourier transforms

0 references

The query complexity of order-finding

0 references

Quantum algorithms revisited

0 references

Sharp quantum versus classical query complexity separations

0 references

Quantum theory, the Church–Turing principle and the universal quantum computer

0 references

Quantum computational networks

0 references

Rapid solution of problems by quantum computation

0 references

0 references

Efficient Computation of the Fourier Transform on Finite Groups

0 references

New directions in cryptography

0 references

Quantum Query Complexity of Some Graph Problems

0 references

On quantum algorithms for noncommutative hidden subgroups

0 references

The quantum query complexity of the hidden subgroup problem is polynomial

0 references

0 references

A modular functor which is universal for quantum computation

0 references

Topological quantum computation

0 references

Simulation of topological field theories by quantum computers

0 references

Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve

0 references

Quantum mechanical algorithms for the nonabelian hidden subgroup problem

0 references

Fast quantum algorithms for computing the unit group and class group of a number field

0 references

Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem

0 references

The Hidden Subgroup Problem and Quantum Computation Using Group Representations

0 references

0 references

Efficient discrete approximations of quantum gates

0 references

A ‘Pretty Good’ Measurement for Distinguishing Quantum States

0 references

Group-theoretic algorithms and graph isomorphism

0 references

Statistical decision theory for quantum systems

0 references

EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM

0 references

On the computational complexity of the Jones and Tutte polynomials

0 references

Bounds for the adiabatic approximation with applications to quantum computation

0 references

A polynomial invariant for knots via von Neumann algebras

0 references

Quantum computation in algebraic number theory: Hallgren's efficient quantum algorithm for solving Pell's equation.

0 references

State models and the Jones polynomial

0 references

Quantum computation of zeta functions of curves

0 references

Hardness of approximating the shortest vector problem in lattices

0 references

Quantum computations: algorithms and error correction

0 references

0 references

Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato

0 references

The quantum query complexity of the abelian hidden subgroup problem

0 references

A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem

0 references

Factoring polynomials with rational coefficients

0 references

Integer Programming with a Fixed Number of Variables

0 references

Universal Quantum Simulators

0 references

Isomorphism of graphs of bounded valence can be tested in polynomial time

0 references

Quantum complexity of testing group commutativity

0 references

Quantum Algorithms for the Triangle Problem

0 references

The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

0 references

The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant

0 references

Generic quantum Fourier transforms

0 references

The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts

0 references

The Symmetric Group Defies Strong Fourier Sampling

0 references

EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS

0 references

Is code equivalence easy to decide?

0 references

Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields

0 references

0 references

0 references

Reliable quantum computers

0 references

Probabilistic algorithm for testing primality

0 references

Random measurement bases, quantum state distinction and applications to the hidden subgroup problem

0 references

New lattice-based cryptographic constructions

0 references

Quantum Computation and Lattice Problems

0 references

A method for obtaining digital signatures and public-key cryptosystems

0 references

Fast Fourier analysis for abelian group extensions

0 references

Classical and quantum function reconstruction via character evaluation

0 references

A hierarchy of polynomial time lattice basis reduction algorithms

0 references

Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p

0 references

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

0 references

On the Power of Quantum Computation

0 references

0 references

Quantum algorithms for weighing matrices and quadratic residues

0 references

Optimal phase estimation in quantum networks

0 references

Quantum Algorithms for Some Hidden Shift Problems

0 references

Counting curves and their projections

0 references

Quantum simulations of classical random walks and undirected graph connectivity

0 references

Quantum field theory and the Jones polynomial

0 references

Optimum testing of multiple hypotheses in quantum detection theory

0 references

Simulating quantum systems on a quantum computer

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3077033

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3077033&oldid=37319634"