Sciweavers

67 search results - page 8 / 14
» Quantum Programming With Mixed States
Sort
View
92
Voted
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
15 years 5 months ago
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...
STOC
2000
ACM
55views Algorithms» more  STOC 2000»
15 years 4 months ago
Self-testing of universal and fault-tolerant sets of quantum gates
We consider the design of self-testers for quantum gates. A self-tester for the gates F 1, . . . , F m is a procedure that, given any gates G1, . . . , Gm, decides with high probab...
Wim van Dam, Frédéric Magniez, Miche...
73
Voted
ENTCS
2008
102views more  ENTCS 2008»
14 years 11 months ago
Programming Languages For Interactive Computing
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
Roly Perera
ORL
2008
111views more  ORL 2008»
14 years 11 months ago
Certificates of linear mixed integer infeasibility
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
Kent Andersen, Quentin Louveaux, Robert Weismantel
KI
2002
Springer
14 years 11 months ago
Integrating Function Application in State-Based Planning
We present an extension of state-based planning from traditional Strips to function application, allowing to express operator effects as updates. As proposed in PDDL, fluent variab...
Ute Schmid, Marina Müller, Fritz Wysotzki