Quantum algorithms revisited
From MaRDI portal
Abstract: Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum computation is viewed as multi-particle interference. We use this approach to review (and improve) some of the existing quantum algorithms and to show how they are related to different instances of quantum phase estimation. We provide an explicit algorithm for generating any prescribed interference pattern with an arbitrary precision.
Recommendations
Cited in
(only showing first 100 items - show all)- Self-protected quantum algorithms based on quantum state tomography
- Realization of Deutsch-like algorithm using ensemble computing
- Efficient quantum algorithms of finding the roots of a polynomial function
- A quantum-inspired evolutionary algorithm using Gaussian distribution-based quantization
- Creating very true quantum algorithms for quantum energy based computing
- Quantum algorithm to solve function inversion with time-space trade-off
- A note on the search for k elements via quantum walk
- Realization of the three-qubit quantum controlled gate based on matching Hermitian generators
- Quantum arithmetic with the quantum Fourier transform
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Heralded quantum gates for atomic systems assisted by the scattering of photons off single emitters
- A review on quantum search algorithms
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- Quantum teleportation and Grover's algorithm without the wavefunction
- The rhythm of quantum algorithms
- Quantum algorithm design: techniques and applications
- Interferometric computation beyond quantum theory
- Oracles and query lower bounds in generalised probabilistic theories
- Efficient quantum algorithm for the parity problem of a certain function
- Quantum key distribution protocol based on modified generalization of Deutsch-Jozsa algorithm in \(d\)-level quantum system
- Necessary and sufficient condition for quantum computing
- Quantum communication based on an algorithm of determining a matrix
- The Deutsch-Jozsa problem: de-quantisation and entanglement
- Quantum communication and complexity.
- The universality of the quantum Fourier transform in forming the basis of quantum computing algorithms
- X states of the same spectrum and entanglement as all two-qubit states
- The variational quantum eigensolver: a review of methods and best practices
- Photonic scheme of quantum phase estimation for quantum algorithms via quantum dots
- Graph comparison via nonlinear quantum search
- A hybrid algorithm to solve linear systems of equations with limited qubit resources
- Multipartite mixed maximally entangled states: mixed states with entanglement 1
- Quantum algorithm for learning secret strings and its experimental demonstration
- Entanglement in phase estimation algorithm and quantum counting algorithm
- Generalization of Deutsch's algorithm
- Revisiting Deutsch-Jozsa algorithm
- An automated deductive verification framework for circuit-building quantum programs
- Computing scalar products via a two-terminal quantum transmission line
- Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation
- A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer
- Physics' evolution toward computing
- De-quantisation of the quantum Fourier transform
- A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
- Extended learning graphs for triangle finding
- Some theoretically organized algorithm for quantum computers
- Quantum algorithm for the root-finding problem
- On exact quantum query complexity
- A different Deutsch-Jozsa
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target
- Generalized quantum counting algorithm for non-uniform amplitude distribution
- Approximate span programs
- On the hitting times of quantum versus random walks
- On the complexity of the multivariate Sturm-Liouville eigenvalue problem
- On the mathematics of quantum computers
- Classical and quantum complexity of the Sturm-Liouville eigenvalue problem
- Quantum walks can find a marked element on any graph
- Quantum fast Poisson solver: the algorithm and complete and modular circuit design
- Solving systems of linear algebraic equations via unitary transformations on quantum processor of IBM quantum experience
- Simulation of three-spin evolution under \(XX\) Hamiltonian on quantum processor of IBM-quantum experience
- Total functions in QMA
- Quantum algorithms for the Goldreich-Levin learning problem
- Entanglement universality of TGX states in qubit-qutrit systems
- A generalisation of the phase kick-back
- What is quantum computation.
- Superlinear advantage for exact quantum algorithms
- Simulating and compiling code for the sequential quantum random access machine
- Potential of quantum finite automata with exact acceptance
- Exact quantum query complexity of \(\mathrm{EXACT}_{k,l}^n\)
- Quantum algorithms for algebraic problems
- Information and computation: Classical and quantum aspects
- The role of relative entropy in quantum information theory
- Quantum Algorithms
- NMR tomography of the three-qubit Deutsch-Jozsa algorithm
- Practical Implementation of a Quantum Backtracking Algorithm
- Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
- Quantum computation and quantum information†
- Fast quantum algorithms for least squares regression and statistic leverage scores
- Multi-query quantum sums
- Quantum Walk Based Search Algorithms
- Statistical properties of thermal state under quantum Hadamard transform
- Gaussian quantum computation with oracle-decision problems
- Gradient flows for optimization in quantum information and quantum dynamics: foundations and applications
- Quantum Queries on Permutations with a Promise
- On the uselessness of quantum queries
- Implementation of the Deutsch-Jozsa algorithm with Josephson charge qubits
- Machines, Logic and Quantum Physics
- scientific article; zbMATH DE number 1795877 (Why is no real title available?)
- A quantum algorithm to approximate the linear structures of Boolean functions
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Quantum-walk speedup of backtracking algorithms
- Quantum pushdown automata with garbage tape
- OPTIMAL STATE ESTIMATION AND CLONING FOR EQUATORIAL QUANTUM SYSTEMS WITH ARBITRARY DIMENSION
- EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
- MEASURED QUANTUM FOURIER TRANSFORM OF 1024 QUBITS ON FIBER OPTICS
- Quantum algorithms for testing and learning Boolean functions
- Generating test patterns for FPGA circuits: a quantum computing approach
- Binary optimal control of single-flux-quantum pulse sequences
- Some error analysis for the quantum phase estimation algorithms
- Fast quantum algorithms for least squares regression and statistic leverage scores
- Operations with elements of transferred density matrix via unitary transformations on extended receiver
This page was built for publication: Quantum algorithms revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223937)
