Uniformity of quantum circuit families for error-free algorithms
type: Item
instance of: scholarly article
title: Uniformity of quantum circuit families for error-free algorithms
zbMATH Open document ID: 1142.68356
author: Harumichi Nishimura
author: Masanao Ozawa
published in: Theoretical Computer Science
publication date: 2005-04-06T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 81P68
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 2153198
zbMATH Keywords: Quantum computation
zbMATH Keywords: Complexity theory
zbMATH Keywords: Uniform circuit families
zbMATH Keywords: Zero-error algorithms
zbMATH Keywords: Exact algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.12.020
OpenAlex ID: W1963604719
cites work: Quantum Computability
cites work: Logical Reversibility of Computation
cites work: Quantum Complexity Theory
cites work: Q4819589
cites work: Quantum theory, the Church–Turing principle and the universal quantum computer
cites work: Quantum computational networks
cites work: Complexity limitations on quantum computation
cites work: Q4228473
cites work: Computational complexity of real functions
cites work: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
cites work: EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
cites work: Programmable Quantum Gate Arrays
cites work: Q2706552
cites work: Computational complexity of uniform quantum circuit families and quantum Turing machines
cites work: Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
cites work: Q3221403
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
DOI: 10.1016/J.TCS.2004.12.020
description: scientific article; zbMATH DE number 2153198