Deterministic polynomial-time quantum algorithms for Simon's problem
type: Item
instance of: scholarly article
title: Deterministic polynomial-time quantum algorithms for Simon's problem
zbMATH Open document ID: 1085.68045
author: Takashi Mihara
author: S-C. Sung
published in: Computational Complexity
publication date: 2005-02-11T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 2133457
zbMATH Keywords: Quantum computer
zbMATH Keywords: deterministic quantum algorithm
zbMATH Keywords: Simon's problem
zbMATH Keywords: extended Simon's problem
MaRDI profile type: Publication
full work available at URL: s00037-003-0181-z
OpenAlex ID: W2013387886
DOI: 10.1007/S00037-003-0181-Z
Recommended article: Q4249527
Recommended article: Quantum Circuits That Can Be Simulated Classically in Polynomial Time
Recommended article: Quantum algorithms for Simon's problem over nonabelian groups
Recommended article: Q2934717
Recommended article: Automata, Languages and Programming
Recommended article: Quantum and classical query complexities for generalized Simon's problem
Recommended article: Polynomial-time algorithm for simulation of weakly interacting quantum Spin systems
Recommended article: Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
Recommended article: A quasipolynomial-time algorithm for the quantum separability problem
Recommended article: Quantum computers that can be simulated classically in polynomial time
description: scientific article; zbMATH DE number 2133457