Quantum implicit computational complexity

We introduce a quantum lambda calculus inspired by Lafont’s Soft Linear Logic and capturing the polynomial quantum complexity classes EQP, BQP and ZQP. The calculus is based on the “classical control and quantum data” paradigm. This is the first example of a formal system capturing quantum complexit...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 411; číslo 2; s. 377 - 409
Hlavní autoři:	Dal Lago, Ugo, Masini, Andrea, Zorzi, Margherita
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Elsevier B.V 02.01.2010 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Exact sciences and technology General logic Implicit computational complexity Lambda calculus Logic and foundations Mathematical logic, foundations, set theory Mathematics Miscellaneous Programming theory Quantum computation Sciences and techniques of general use Theoretical computing Quantum computation Lambda calculus Implicit computational complexity Polynomial Complexity class Linear logic Paradigm Computer theory Syntax Computational complexity
ISSN:	0304-3975, 1879-2294
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!