Rapid solution of problems by quantum computation
From MaRDI portal
Publication:4033175
DOI10.1098/rspa.1992.0167zbMath0792.68058OpenAlexW2050334794WikidataQ55934567 ScholiaQ55934567MaRDI QIDQ4033175
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
Related Items (only showing first 100 items - show all)
QuantQueryEXP : A novel strategic approach for query expansion based on quantum computing principles ⋮ Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies ⋮ An Optimal Separation of Randomized and Quantum Query Complexity ⋮ Unnamed Item ⋮ Quantum information and correlation bounds ⋮ A public key cryptosystem based on data complexity under quantum environment ⋮ QUANTUM STATE TOMOGRAPHY AND QUANTUM LOGICAL OPERATIONS IN A THREE QUBITS NMR QUADRUPOLAR SYSTEM ⋮ DE-QUANTIZING THE SOLUTION OF DEUTSCH'S PROBLEM ⋮ Quantum circuits of $ \newcommand{\cZ}{c-\mathtt{Z}} \cZ$ and $ \newcommand{\Swap}{\mathtt{SWAP}} \Swap$ gates: optimization and entanglement ⋮ QUANTUM QUERY COMPLEXITY OF CONSTANT-SIZED SUBGRAPH CONTAINMENT ⋮ GEOMETRIC PHASES AND TOPOLOGICAL QUANTUM COMPUTATION ⋮ On Deciding Whether a Boolean Function is Constant or Not ⋮ D-Wave and predecessors: From simulated to quantum annealing ⋮ Trading quantum for classical resources in quantum data compression ⋮ Natural Quantum Operational Semantics with Predicates ⋮ From Quantum Query Complexity to State Complexity ⋮ Classical and Quantum Counter Automata on Promise Problems ⋮ Potential of Quantum Finite Automata with Exact Acceptance ⋮ Entanglement witness and multipartite quantum state discrimination ⋮ Distributed Bernstein-Vazirani algorithm ⋮ Following forrelation -- quantum algorithms in exploring Boolean functions' spectra ⋮ A family of unitaries for the quantum period finding algorithm ⋮ ON THE NON-EXISTENCE OF A UNIVERSAL HADAMARD GATE ⋮ Interference as a computational resource: a tutorial ⋮ Rapid solution of problems by quantum computation ⋮ Variable ansatz applied to spectral operator decomposition in a physical superconducting quantum device ⋮ Performance of Grover's search algorithm with diagonalizable collective noises ⋮ A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle ⋮ Application of quantum approximate optimization algorithm to job shop scheduling problem ⋮ A quantum algorithm to approximate the linear structures of Boolean functions ⋮ Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$ ⋮ Linear-algebraic λ-calculus: higher-order, encodings, and confluence. ⋮ Generalizations of the distributed Deutsch–Jozsa promise problem ⋮ Unnamed Item ⋮ Fidelity-optimized quantum state estimation ⋮ A classical limit of Grover’s algorithm induced by dephasing: Coherence versus entanglement ⋮ THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS ⋮ An Introduction to Quantum Computing, without the Physics ⋮ ANALYSIS OF QUANTUM FUNCTIONS ⋮ QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES ⋮ Quantum hypergraph states ⋮ A strategy for quantum algorithm design assisted by machine learning ⋮ Signal-based classical emulation of a universal quantum computer ⋮ Quantum and classical query complexities of local search are polynomially related ⋮ Quantum Pushdown Automata with Garbage Tape ⋮ Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians ⋮ MULTI-COMPONENT SQUEEZED COHERENT STATE FOR N TRAPPED IONS IN ANY POSITION OF A STANDING WAVE ⋮ THEORETICAL AND EXPERIMENTAL ASPECTS OF QUANTUM DISCORD AND RELATED MEASURES ⋮ Matchgates and classical simulation of quantum circuits ⋮ NMR Quantum Computing ⋮ Revisiting the simulation of quantum Turing machines by quantum circuits ⋮ One-Qubit and Two-Qubit Codes in Noisy State Transfer ⋮ ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM ⋮ Quantum Algorithms Related to $$\textit{HN}$$ -Transforms of Boolean Functions ⋮ Counting by quantum eigenvalue estimation ⋮ MAXIMALLY ENTANGLED STATES FOR MANY TRAPPED IONS FROM SINGLE RESONANT INTERACTIONS ⋮ Unnamed Item ⋮ ENTANGLEMENT AND INFORMATION TRANSFER PROTOCOL BETWEEN TWO QUBITS ⋮ Analogies and differences between quantum and stochastic automata ⋮ Quasiclassical computation ⋮ Dispelling myths on superposition attacks: formal security model and attack analyses ⋮ Quantum algorithms for algebraic problems ⋮ Information and computation: Classical and quantum aspects ⋮ Quantum computation and quantum information† ⋮ A NEW PARAMETER OF ENTANGLEMENT FOR A QUBIT SYSTEM PLACED INSIDE A DISSIPATIVE CAVITY ⋮ A quantum speedup in machine learning: finding anN-bit Boolean function for a classification ⋮ EXTRACTION OF VALUE OF FUNCTION f(x) IN DEUTSCH ALGORITHM AND DEUTSCH–JOZSA ALGORITHM ⋮ DELETING A MARKED BASIS-STATE FROM AN EVEN SUPERPOSITION OF ALL BASIS-STATES WITH A SINGLE QUERY ⋮ Quantum-enhanced deliberation of learning agents using trapped ions ⋮ TELEPORTING N ROTATIONS ONTO N REMOTE QUBITS BY AN ENTANGLED QUDIT CHANNEL ⋮ Quantum Queries on Permutations with a Promise ⋮ Implementation of the Deutsch-Jozsa algorithm with Josephson charge qubits ⋮ Three-qubit network with a single trapped electron ⋮ Fast quantum modular exponentiation ⋮ NMR tomography of the three-qubit Deutsch-Jozsa algorithm ⋮ Fiber-Optics Implementation of the Deutsch-Jozsa and Bernstein-Vazirani Quantum Algorithms with Three Qubits ⋮ Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer ⋮ Deutsch-Jozsa Algorithm Using Triggered Single Photons from a Single Quantum Dot ⋮ Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations ⋮ HADAMARD TYPE OPERATIONS FOR QUBITS ⋮ Generation of elementary gates and Bell’s states using controlled adiabatic evolutions ⋮ Quantum Queries on Permutations ⋮ Coherence makes quantum systems ‘magical’ ⋮ An Application of the Deutsch-Jozsa Algorithm to Formal Languages and the Word Problem in Groups ⋮ Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation ⋮ Quadrature squeezing of a mechanical resonator generated by the electromechanical coupling with two coupled quantum dots ⋮ Necessary and Sufficient Conditions for Quantum Computation ⋮ Quantum Perceptrons ⋮ Nanostructures, Entanglement and the Physics of Quantum Control ⋮ Oracle Quantum Computing ⋮ Information Exclusion Principle for Complementary Observables ⋮ Demonstration of a Fundamental Quantum Logic Gate ⋮ Quantum computing: beyond the limits of conventional computation† ⋮ PREPARATION AND STORAGE OF ENTANGLED STATES FOR MULTIPLE TRAPPED IONS IN THERMAL MOTION ⋮ Extending the Promise of the Deutsch–Jozsa–Høyer Algorithm for Finite Groups ⋮ Testing Boolean Functions Properties ⋮ The physics of quantum computation ⋮ Lattice structure based metric for feature data fusion ⋮ The information role of entanglement and interference operators in Shor quantum algorithm gate dynamics ⋮ Physical quantum algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extended multivariate public key cryptosystems with secure encryption function
- Differential cryptanalysis of DES-like cryptosystems
- Improved construction of LDPC convolutional codes with semi-random parity-check matrices
- Quantum algorithm to find invariant linear structure of \(MD\) hash functions
- Symmetric-key cryptosystem with DNA technology
- Quantum Computation and Quantum Information
- Tensor rank is NP-complete
- Protecting Information
- Rapid solution of problems by quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- 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
- Realizable Universal Quantum Logic Gates
- Demonstration of a Fundamental Quantum Logic Gate
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
- Construction of minimal trellises for quantum stabilizer codes
- Batch proxy quantum blind signature scheme
- Asymmetric encryption and signature method with DNA technology
- Mixed-state entanglement and quantum error correction
- Most Tensor Problems Are NP-Hard
This page was built for publication: Rapid solution of problems by quantum computation
