Quantum algorithms for algebraic problems
From MaRDI portal
Publication:3077033
DOI10.1103/REVMODPHYS.82.1zbMath1205.81057arXiv0812.0380OpenAlexW1972883454WikidataQ27350179 ScholiaQ27350179MaRDI QIDQ3077033
Publication date: 21 February 2011
Published in: Reviews of Modern Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.0380
Quantum computation (81P68) Software, source code, etc. for problems pertaining to quantum theory (81-04)
Related Items (34)
Quantum algorithm for total least squares data fitting ⋮ Quantum Implementation of Numerical Methods for Convection-Diffusion Equations: Toward Computational Fluid Dynamics ⋮ Analytical solutions for quantum walks on 1D chain with different shift operators ⋮ Non-Pauli observables for CWS codes ⋮ A novel quantum representation for log-polar images ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Quantum algorithms for typical hard problems: a perspective of cryptanalysis ⋮ Quantum algorithm for solving hyperelliptic curve discrete logarithm problem ⋮ Quantum algorithm for estimating largest eigenvalues ⋮ SCALLOP: scaling the CSI-FiSh ⋮ Quantum mutual information and quantumness vectors for multiqubit systems ⋮ Computing primitive idempotents in finite commutative rings and applications ⋮ An Arbitrated Quantum Signature Scheme without Entanglement * ⋮ \texttt{tqix}: a toolbox for quantum in \texttt{x}. \texttt{x}: quantum measurement, quantum tomography, quantum metrology, and others ⋮ Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime fields ⋮ Exact solutions and symmetry analysis for the limiting probability distribution of quantum walks ⋮ Single channel quantum color image encryption algorithm based on HSI model and quantum Fourier transform ⋮ Factorization of numbers with Gauss sums: I. Mathematical background ⋮ Multiple network alignment on quantum computers ⋮ Efficient quantum algorithm for the parity problem of a certain function ⋮ On the role of dealing with quantum coherence in amplitude amplification ⋮ Models of quantum computation and quantum programming languages ⋮ Quantum walks: a comprehensive review ⋮ ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM ⋮ Phase space entanglement spectrum ⋮ Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count ⋮ Pretty good state transfer of entangled states through quantum spin chains ⋮ OPTIMAL CLONING WITH RESPECT TO THE RELATIVE ERROR ⋮ Quantum Algorithms for a Set of Group Theoretic Problems ⋮ Leveraging the hardness of dihedral coset problem for quantum cryptography ⋮ Quantum search degeneration under amplitude noise in queries to the oracle ⋮ An encryption protocol for NEQR images based on one-particle quantum walks on a circle ⋮ Individual attacks with generalized discrimination and inadequacy of some information measures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new universal and fault-tolerant quantum basis
- The query complexity of order-finding
- Counting curves and their projections
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- Random measurement bases, quantum state distinction and applications to the hidden subgroup problem
- Fast Fourier analysis for abelian group extensions
- State models and the Jones polynomial
- On the computational complexity of the general discrete Fourier transform
- A hierarchy of polynomial time lattice basis reduction algorithms
- Quantum field theory and the Jones polynomial
- Fast generalized Fourier transforms
- Probabilistic algorithm for testing primality
- Group-theoretic algorithms and graph isomorphism
- Factoring polynomials with rational coefficients
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Quantum computation in algebraic number theory: Hallgren's efficient quantum algorithm for solving Pell's equation.
- PRIMES is in P
- Classical and quantum function reconstruction via character evaluation
- Simulation of topological field theories by quantum computers
- A modular functor which is universal for quantum computation
- Sharp quantum versus classical query complexity separations
- Quantum algorithms for weighing matrices and quadratic residues
- Fast Monte Carlo algorithms for permutation groups
- Statistical decision theory for quantum systems
- The quantum query complexity of the abelian hidden subgroup problem
- The quantum query complexity of the hidden subgroup problem is polynomial
- Quantum computation of zeta functions of curves
- Quantum complexity of testing group commutativity
- The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
- Generic quantum Fourier transforms
- Quantum computational networks
- Integer Programming with a Fixed Number of Variables
- Universal Quantum Simulators
- Spatial search and the Dirac equation
- Fault-Tolerant Quantum Computation with Constant Error Rate
- Quantum Algorithms for Some Hidden Shift Problems
- Efficient Computation of the Fourier Transform on Finite Groups
- The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
- Bounds for the adiabatic approximation with applications to quantum computation
- Hardness of approximating the shortest vector problem in lattices
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- The Symmetric Group Defies Strong Fourier Sampling
- Fast quantum algorithms for computing the unit group and class group of a number field
- A polynomial invariant for knots via von Neumann algebras
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- New directions in cryptography
- Rapid solution of problems by quantum computation
- Optimum testing of multiple hypotheses in quantum detection theory
- A method for obtaining digital signatures and public-key cryptosystems
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Simulating quantum systems on a quantum computer
- Quantum algorithms revisited
- Reliable quantum computers
- Quantum computations: algorithms and error correction
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- Is code equivalence easy to decide?
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Computability
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- A ‘Pretty Good’ Measurement for Distinguishing Quantum States
- Quantum Computation and Lattice Problems
- EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
- On the computational complexity of the Jones and Tutte polynomials
- Topological quantum computation
- Reversing quantum dynamics with near-optimal quantum and classical fidelity
- Efficient discrete approximations of quantum gates
- Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Optimal phase estimation in quantum networks
- Quantum Algorithms for the Triangle Problem
- New lattice-based cryptographic constructions
- Quantum lower bounds by polynomials
- Quantum Walk Algorithm for Element Distinctness
- Quantum Query Complexity of Some Graph Problems
- EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Approximate Counting and Quantum Computation
- A polynomial quantum algorithm for approximating the Jones polynomial
- Noise-tolerant learning, the parity problem, and the statistical query model
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- On quantum algorithms for noncommutative hidden subgroups
- Quantum simulations of classical random walks and undirected graph connectivity
- Counting points on curves and Abelian varieties over finite fields
This page was built for publication: Quantum algorithms for algebraic problems
