Sciweavers

3328 search results - page 86 / 666
» Topological Quantum Computation
Sort
View
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
14 years 4 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»
14 years 2 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...
SIAMSC
2010
117views more  SIAMSC 2010»
13 years 8 months ago
Least-Squares Finite Element Methods for Quantum Electrodynamics
A significant amount of the computational time in large Monte Carlo simulations of lattice field theory is spent inverting the discrete Dirac operator. Unfortunately, traditional...
James J. Brannick, C. Ketelsen, Thomas A. Manteuff...
ENTCS
2008
106views more  ENTCS 2008»
13 years 10 months ago
Computability and Representations of the Zero Set
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
Pieter Collins
ISAAC
2009
Springer
93views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Computing Multidimensional Persistence
Abstract. The theory of multidimensional persistence captures the topology of a multifiltration – a multiparameter family of increasing spaces. Multifiltrations arise naturally...
Gunnar Carlsson, Gurjeet Singh, Afra Zomorodian