Sciweavers

2479 search results - page 42 / 496
» Quantum complexity theory
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 7 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
14 years 3 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
LOGCOM
2010
85views more  LOGCOM 2010»
13 years 8 months ago
The Logic of Quasi-MV Algebras
The algebraic theory of quasi-MV algebras, generalisations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define sever...
Félix Bou, Francesco Paoli, Antonio Ledda, ...
CALCO
2005
Springer
104views Mathematics» more  CALCO 2005»
14 years 3 months ago
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
Samson Abramsky
ECCC
2007
123views more  ECCC 2007»
13 years 10 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters