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)
- 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
- Quantum computation: algorithms and applications
- A classical limit of Grover's algorithm induced by dephasing: coherence versus entanglement
- A low failure rate quantum algorithm for searching maximum or minimum
- Quantum abstract detecting systems
- Simulation of three-spin evolution under \(XX\) Hamiltonian on quantum processor of IBM-quantum experience
- Relaxation process of a two-level system in a coherent superposition of two environments
- Permutation symmetric hypergraph states and multipartite quantum entanglement
- One-dimensional quantum walks with a time and spin-dependent phase shift
- The ambiguity of simplicity in quantum and classical simulation
- A normal form for single-qudit Clifford+\(T\) operators
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- Physics' evolution toward computing
- Extending the Promise of the Deutsch–Jozsa–Høyer Algorithm for Finite Groups
- Nanostructures, Entanglement and the Physics of Quantum Control
- Multiparty multicast schemes for remote state preparation of complex coefficient quantum states via partially entangled channels
- A strategy for quantum algorithm design assisted by machine learning
- Criteria for SLOCC and LU equivalence of generic multi-qudit states
- An introduction to quantum computing, without the physics
- Succinct arguments in the quantum random oracle model
- Query complexity of unitary operation discrimination
- Implementation of Deutsch and Deutsch-Jozsa-like algorithms involving classical entanglement of elastic bits
- Decoherence mitigation by embedding a logical qubit in a qudit
- Interference as a computational resource: a tutorial
- Quantum walks for the determination of commutativity of finite dimensional algebras
- Quantum generative adversarial networks based on Rényi divergences
- Quantum hypergraph states
- An exact quantum algorithm for a restricted subtraction game
- Synthesis of Deutsch-Jozsa circuits and verification by IBM Q
- Quantum computers and possible wavefunction collapse
- Generalization of Deutsch's algorithm
- Some theoretically organized algorithm for quantum computers
- Quantum median filter for total variation image denoising
- Time complexity analysis of quantum difference methods for linear high dimensional and multiscale partial differential equations
- Quantum queries on permutations
- Directed graph encoding in quantum computing supporting edge-failures
- One-qubit and two-qubit codes in noisy state transfer
- Design and implementation of MQIR image scaling
- On the complexity of the hidden subgroup problem
- 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
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)
