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
- A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
- Multipartite entanglement in Grover's search algorithm
- Environment assisted energy transfer in dimer system
- Optimal processing of reversible quantum channels
- Quantum computation based on retarded and advanced propagation.
- Milestone developments in quantum information and no-go theorems
- Scheme for probabilistic remotely preparing a \(d\)-dimensional equatorial quantum state
- Quantum and classical query complexities of local search are polynomially related
- Fidelity-optimized quantum state estimation
- Quantum algorithm to solve function inversion with time-space trade-off
- Resolving the forecasting problems of overshoot and volatility clustering using ANFIS coupling nonlinear heteroscedasticity with quantum tuning
- On the black-box complexity of Sperner's Lemma
- Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation
- From quantum query complexity to state complexity
- Generalizations of the distributed Deutsch-Jozsa promise problem
- Oracle Quantum Computing
- Entanglement of the quantum system with spin-spin coupling created by optical excitation
- The 50\% advanced information rule of the quantum algorithms
- Quantum Perceptrons
- Natural Quantum Operational Semantics with Predicates
- A relation between fidelity and quantum adiabatic evolution
- Generalization and demonstration of an entanglement-based Deutsch-jozsa-like algorithm using a 5-qubit quantum computer
- A quantum speedup in machine learning: finding an \(N\)-bit Boolean function for a classification
- The Deutsch-Jozsa problem: de-quantisation and entanglement
- Models of quantum computation and quantum programming languages
- Quantum image processing?
- Quantum information processing, operational quantum logic, convexity, and the foundations of physics
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
- X states of the same spectrum and entanglement as all two-qubit states
- Trading quantum for classical resources in quantum data compression
- Fast quantum modular exponentiation
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
- A quantum-inspired evolutionary algorithm using Gaussian distribution-based quantization
- Efficient quantum algorithms of finding the roots of a polynomial function
- The physics of quantum computation
- On the solution of trivalent decision problems by quantum state identification
- Implementation of Grover's search algorithm in the QED circuit for two superconducting qubits
- Sure success partial search
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- The behavior of the two-level entangled atom in an optical field
- Classification of Boolean functions by the invariants of their matrix representation
- Quantum computation with classical light: the Deutsch algorithm
- Exact quantum query complexity of \(\mathrm{EXACT}_{k,l}^n\)
- A proposal for the realization of universal quantum gates via superconducting qubits inside a cavity
- Space-bounded quantum complexity
- Efficient protocol of \(N\)-bit discrete quantum Fourier transform via transmon qubits coupled to a resonator
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Evaluation of exact quantum query complexities by semidefinite programming
- Quantification of entanglement by means of convergent iterations
- Computational complexity of uniform quantum circuit families and quantum Turing machines
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)
