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
- 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
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)
