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)- Quantum algorithms for algebraic problems
- MMSE detection method in uplink massive MIMO systems based on quantum computing
- Revisiting Deutsch-Jozsa algorithm
- On the mathematics of quantum computers
- The universality of the quantum Fourier transform in forming the basis of quantum computing algorithms
- A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
- Quantum walks can find a marked element on any graph
- 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
- Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target
- Ancilla-based quantum simulation
- Quantum algorithm design: techniques and applications
- Oracles and query lower bounds in generalised probabilistic theories
- What is quantum computation.
- Implementation of the Deutsch-Jozsa algorithm with Josephson charge qubits
- Quantum algorithm for learning secret strings and its experimental demonstration
- Enhancing scalability and accuracy of quantum Poisson solver
- A different Deutsch-Jozsa
- Quantum algorithm to solve function inversion with time-space trade-off
- On exact quantum query complexity
- Interferometric computation beyond quantum theory
- Necessary and sufficient condition for quantum computing
- Quantum key distribution protocol based on modified generalization of Deutsch-Jozsa algorithm in \(d\)-level quantum system
- Quantum communication based on an algorithm of determining a matrix
- The 50\% advanced information rule of the quantum algorithms
- Discrete optimization: a quantum revolution?
- Quantum resources in Harrow-Hassidim-Lloyd algorithm
- Mathematical digital quantum computation by means of much more logical skills
- Total functions in QMA
- The query complexity of order-finding
- A partially random Trotter algorithm for quantum Hamiltonian simulations
- Simulation of three-spin evolution under \(XX\) Hamiltonian on quantum processor of IBM-quantum experience
- Realization of Deutsch-like algorithm using ensemble computing
- An automated deductive verification framework for circuit-building quantum programs
- Computing scalar products via a two-terminal quantum transmission line
- Operations with elements of transferred density matrix via unitary transformations on extended receiver
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- The Deutsch-Jozsa problem: de-quantisation and entanglement
- Practical Implementation of a Quantum Backtracking Algorithm
- Quantum communication and complexity.
- Physics' evolution toward computing
- Quantum cryptography based on an algorithm for determining simultaneously all the mappings of a Boolean function
- NMR tomography of the three-qubit Deutsch-Jozsa algorithm
- Software science view on quantum circuit algorithms
- Gaussian quantum computation with oracle-decision problems
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer
- Quantum algorithm for the root-finding problem
- X states of the same spectrum and entanglement as all two-qubit states
- Concrete analysis of quantum lattice enumeration
- Quantum simulation of colour in perturbative quantum chromodynamics
- Topological quantum information, virtual Jones polynomials and Khovanov homology
- A quantum-inspired evolutionary algorithm using Gaussian distribution-based quantization
- The quantum speed up as advanced cognition of the solution
- De-quantisation of the quantum Fourier transform
- Quantum computation and quantum information†
- Creating very true quantum algorithms for quantum energy based computing
- Efficient quantum algorithms of finding the roots of a polynomial function
- The geometry of quantum learning
- The mechanism of quantum computation
- On the solution of trivalent decision problems by quantum state identification
- Non-Boolean quantum amplitude amplification and quantum mean estimation
- Thermal entanglement of the two-qubit Heisenberg spin chain coupled to a single-mode cavity field
- Equivalence between contextuality and negativity of the Wigner function for qudits
- The significance of theC-numerical range and the localC-numerical range in quantum control and quantum information
- Book review of: R. J. Lipton and K. W. Regan, Quantum algorithms via linear algebra. A primer
- Representation-theoretical properties of the approximate quantum Fourier transform
- Machines, Logic and Quantum Physics
- Quantum pushdown automata with garbage tape
- Quantum Monte Carlo for economics: stress testing and macroeconomic deep learning
- On the complexity of the multivariate Sturm-Liouville eigenvalue problem
- Potential of quantum finite automata with exact acceptance
- Faster cryptographic hash function from supersingular isogeny graphs
- EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE
- MEASURED QUANTUM FOURIER TRANSFORM OF 1024 QUBITS ON FIBER OPTICS
- Exact quantum query complexity of \(\mathrm{EXACT}_{k,l}^n\)
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- A strategy for quantum algorithm design assisted by machine learning
- "NON-IDENTITY-CHECK" IS QMA-COMPLETE
- Universal quantum computation by scattering in the Fermi–Hubbard model
- Quasiclassical computation
- On the hitting times of quantum versus random walks
- OPTIMAL STATE ESTIMATION AND CLONING FOR EQUATORIAL QUANTUM SYSTEMS WITH ARBITRARY DIMENSION
- Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
- Binary optimal control of single-flux-quantum pulse sequences
- Generalised phase kick-back: the structure of computational algorithms from physical principles
- Simulating and compiling code for the sequential quantum random access machine
- EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
- Distributed Grover's algorithm
- Generating test patterns for FPGA circuits: a quantum computing approach
- Estimating the number of states of a quantum system via the rodeo algorithm for quantum computation
- Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation
- Phase-sensitive superposition of quantum states
- A note on the search for k elements via quantum walk
- LWE with quantum amplitudes: Algorithm, hardness, and oblivious sampling
- Estimation strategies for finite dimensional systems
- Classical and quantum complexity of the Sturm-Liouville eigenvalue problem
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)
