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)
- 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
- Information and computation: Classical and quantum aspects
- On a poset of quantum exact promise problems
- On the power of Ambainis lower bounds
- A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions
- Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
- MULTI-COMPONENT SQUEEZED COHERENT STATE FOR N TRAPPED IONS IN ANY POSITION OF A STANDING WAVE
- Demonstration of a Fundamental Quantum Logic Gate
- On the entanglement and engineering phase gates without dynamical phases for a two-qubit system with Dzyaloshinski-Moriya interaction in magnetic field
- On the circuit model of global adiabatic search algorithm
- An exact quantum search algorithm with arbitrary database
- Classical and Quantum Counter Automata on Promise Problems
- Quantum information and correlation bounds
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
- TELEPORTING N ROTATIONS ONTO N REMOTE QUBITS BY AN ENTANGLED QUDIT CHANNEL
- Realization of quantum gates with multiple control qubits or multiple target qubits in a cavity
- An introduction to many worlds in quantum computation
- Quantum mappings and characterization of entangled quantum states
- Quantum Queries on Permutations with a Promise
- Fiber optics protocols for quantum communication
- A model of discrete quantum computation
- Generating three-dimensional entanglement for atomic ensembles trapped in two separated cavity via an optical fiber
- On the Power of Quantum Computation
- Regular languages accepted by quantum automata
- Role of coherence in adiabatic search algorithms
- Rapid solution of problems by quantum computation
- Quantum weakly nondeterministic communication complexity
- A fast quantum image encryption algorithm based on affine transform and fractional-order Lorenz-like chaotic dynamical system
- Matchgates and classical simulation of quantum circuits
- Resonant transition-based quantum computation
- Quantum algorithms for algebraic problems
- Quantum alternation: prospects and problems
- Revisiting Deutsch-Jozsa algorithm
- Blind quantum machine learning based on quantum circuit model
- Quantum algorithms for learning Walsh spectra of multi-output Boolean functions
- Quantum cryptographic property testing of multi-output Boolean functions
- Combinatorial and rotational quantum abstract detecting systems
- Quantum absentminded driver problem revisited
- Solving Bernstein and Vazirani's problem with the 2-bit permutation function
- Deterministic algorithms for the hidden subgroup problem
- Probability amplitude-encoded multichannel representation for quantum audio signals
- Efficient quantum algorithms related to autocorrelation spectrum
- Finite-data-size study on practical universal blind quantum computation
- Quantum Relief algorithm
- Non-classicality created by quantum channels with indefinite causal order
- An improved quantum algorithm for the quantum learning with errors problem
- Double sparse quantum state preparation
- Quantum algorithm for learning secret strings and its experimental demonstration
- A novel three-party quantum secret sharing scheme based on Bell state sequential measurements with application in quantum image sharing
- A different Deutsch-Jozsa
- Non-local quantum functions and the distributed Deutsch-Jozsa algorithm
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)
