Rapid solution of problems by quantum computation
From MaRDI portal
Publication:4033175
DOI10.1098/RSPA.1992.0167zbMATH Open0792.68058OpenAlexW2050334794WikidataQ55934567 ScholiaQ55934567MaRDI QIDQ4033175FDOQ4033175
Authors: David Deutsch, Richard Jozsa 
Publication date: 16 May 1993
Published in: Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rspa.1992.0167
Recommendations
Cites Work
- Demonstration of a Fundamental Quantum Logic Gate
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Most tensor problems are NP-hard
- Quantum computation and quantum information. 10th anniversary edition
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Mixed-state entanglement and quantum error correction
- Quantum Vernam cipher
- Rapid solution of problems by quantum computation
- Title not available (Why is that?)
- Differential cryptanalysis of DES-like cryptosystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Batch proxy quantum blind signature scheme
- Title not available (Why is that?)
- Realizable Universal Quantum Logic Gates
- Tensor rank is NP-complete
- Title not available (Why is that?)
- Extended multivariate public key cryptosystems with secure encryption function
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
- Improved construction of LDPC convolutional codes with semi-random parity-check matrices
- Quantum algorithm to find invariant linear structure of \(MD\) hash functions
- Protecting Information
- Symmetric-key cryptosystem with DNA technology
- Asymmetric encryption and signature method with DNA technology
- Construction of minimal trellises for quantum stabilizer codes
Cited In (only showing first 100 items - show all)
- Modelling the brain processes of conscious states
- Hypothetical solution of the problem of measurement through the notion of quantum backward causality
- Mathematical models of quantum computation
- Implementation of the Deutsch-Jozsa algorithm with Josephson charge qubits
- Quantum algorithm design: techniques and applications
- On the simulation of quantum Turing machines.
- 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
- A one-way function from thermodynamics and applications to cryptography
- Realization of Deutsch-like algorithm using ensemble computing
- Preparation of multi-party entanglement of individual photons and atomic ensembles
- 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
- Entanglement witness and multipartite quantum state discrimination
- Quantum and classical query complexities for generalized Deutsch-Jozsa problems
- De-quantisation of the quantum Fourier transform
- Creating very true quantum algorithms for quantum energy based computing
- Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup
- Coherence-based measure of quantumness in (non-) Markovian channels
- Quantum correlations and decoherence dynamics for a qutrit-qutrit system under random telegraph noise
- Quantum pushdown automata with garbage tape
- Quantum algorithm for solving hyperelliptic curve discrete logarithm problem
- Quantum iSWAP gate in optical cavities with a cyclic three-level system
- Rapid sampling though quantum computing
- Consciousness: Computing the uncomputable
- Decoherence of a two-level system in a coherent superposition of two dephasing environments
- Quadrature squeezing of a mechanical resonator generated by the electromechanical coupling with two coupled quantum dots
- A quantum probability splitter and its application to qubit preparation
- Reasoning about faulty quantum programs
- Optimal separation in exact query complexities for Simon's problem
- Efficient quantum algorithm for the parity problem of a certain function
- A new parameter of entanglement for a qubit system placed inside a dissipative cavity
- An improved lower bound on query complexity for quantum PAC learning
- Superlinear advantage for exact quantum algorithms
- Necessary and Sufficient Conditions for Quantum Computation
- Dynamic Grover search: applications in recommendation systems and optimization problems
- Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity
- Query complexity of generalized Simon's problem
- On Deciding Whether a Boolean Function is Constant or Not
- Quantum circuits of $ \newcommand{\cZ}{c-\mathtt{Z}} \cZ$ and $ \newcommand{\Swap}{\mathtt{SWAP}} \Swap$ gates: optimization and entanglement
- Revisiting the simulation of quantum Turing machines by quantum circuits
- The Landauer resistance and band spectra for the counting quantum Turing machine.
- Distributed Bernstein-Vazirani algorithm
- Global multipartite entanglement dynamics in Grover's search algorithm
- Quantum teleportation and Grover's algorithm without the wavefunction
- Multipartite mixed maximally entangled states: mixed states with entanglement 1
- A classical probability space exists for the measurement theory based on the truth values
- Renormalization of quantum coherence and quantum phase transition in the Ising model
- Complete deterministic analyzer for multi-electron Greenberger-Horne-Zeilinger states assisted by double-side optical microcavities
- Quantum pattern search with closed match
- Can von Neumann's theory meet the Deutsch-Jozsa algorithm?
- Three-qubit network with a single trapped electron
- Image segmentation on a quantum computer
- Quantum Boolean image denoising
- Application of Grover's algorithm to check non-resiliency of a Boolean function
- Quantum computing without entanglement
- On exact quantum query complexity
- Controlling quantum coherence of a two-component Bose-Einstein condensate via an impurity atom
- Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics
- A theoretical framework for quantum image representation and data loading scheme
- THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS
- Quantum state tomography and quantum logical operations in a three qubits NMR quadrupolar system
- Quantum query complexity of constant-sized subgraph containment
- Controllability and universal three-qubit quantum computation with trapped electron states
- Can quantum entanglement detection schemes improve search?
- Optimality proofs of quantum weight decision algorithms
- Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
- Quantum communication and complexity.
- From quantum cellular automata to quantum lattice gases
- Quantum computation with coherent spin states and the close Hadamard problem
- Quantum zero-error algorithms cannot be composed
- An Optimal Separation of Randomized and Quantum Query Complexity
- PREPARATION AND STORAGE OF ENTANGLED STATES FOR MULTIPLE TRAPPED IONS IN THERMAL MOTION
- Gaussian quantum computation with oracle-decision problems
- Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables
- MAXIMALLY ENTANGLED STATES FOR MANY TRAPPED IONS FROM SINGLE RESONANT INTERACTIONS
- Quantum computation and quantum information†
- Quantum walks: a comprehensive review
- Entanglement is not necessary for perfect discrimination between unitary operations
- Theoretical and experimental aspects of quantum discord and related measures
- Fundamentals of quantum information theory
- Quantum pseudo-telepathy
- Potential of quantum finite automata with exact acceptance
- GEOMETRIC PHASES AND TOPOLOGICAL QUANTUM COMPUTATION
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- Quantum computer simulation using the CUDA programming model
- Histogram-based segmentation of quantum images
- Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
- Realization of a quantum gate using gravitational search algorithm by perturbing three-dimensional harmonic oscillator with an electromagnetic field
- Quantum coherence and geometric quantum discord
- New features of Wehrl entropy and Wehrl PD of a single Cooper-pair box placed inside a dissipative cavity
- ANALYSIS OF QUANTUM FUNCTIONS
- Berry phases and entanglement of a two spin-1/2 model with Dzyaloshinski-Moriya interaction in magnetic fields
- Efficient quantum algorithms to construct arbitrary Dicke states
- Circuit QED: implementation of the three-qubit refined Deutsch-Jozsa quantum algorithm
- Determining the parity of a permutation using an experimental NMR qutrit
- Counting by quantum eigenvalue estimation
- Quantum theory and determinism
This page was built for publication: Rapid solution of problems by quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033175)
