Rapid solution of problems by quantum computation
type: Item
instance of: scholarly article
title: Rapid solution of problems by quantum computation
zbMATH Open document ID: 0792.68058
author: David Deutsch
author: Richard Jozsa
published in: Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 165345
zbMATH Keywords: quantum computation
zbMATH Keywords: modes of computation
Wikidata QID: Q55934567
MaRDI profile type: Publication
full work available at URL: rspa.1992.0167
OpenAlex ID: W2050334794
cites work: Quantum Complexity Theory
cites work: On the Power of Quantum Computation
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: Q4939150
cites work: The Hidden Subgroup Problem and Quantum Computation Using Group Representations
cites work: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
cites work: Mixed-state entanglement and quantum error correction
cites work: Q3522361
cites work: Batch proxy quantum blind signature scheme
cites work: Construction of minimal trellises for quantum stabilizer codes
cites work: Q4762335
cites work: Symmetric-key cryptosystem with DNA technology
cites work: Asymmetric encryption and signature method with DNA technology
cites work: Q4536799
cites work: Extended multivariate public key cryptosystems with secure encryption function
cites work: Improved construction of LDPC convolutional codes with semi-random parity-check matrices
cites work: Differential cryptanalysis of DES-like cryptosystems
cites work: Q4318717
cites work: Strengths and Weaknesses of Quantum Computing
cites work: Realizable Universal Quantum Logic Gates
cites work: Demonstration of a Fundamental Quantum Logic Gate
cites work: Protecting Information
cites work: Quantum Computation and Quantum Information
cites work: Tensor rank is NP-complete
cites work: Most Tensor Problems Are NP-Hard
cites work: Q4869527
cites work: Quantum algorithm to find invariant linear structure of \(MD\) hash functions
DOI: 10.1098/RSPA.1992.0167
description: scientific article