Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha  Home/Search
Context
Related
| lri.fr/~magniez/PAP...dmmsstoc00.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lri.fr/Francais/Recherche...publi (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the design of self-testers for quantum gates. A self-tester for the gates F 1 ; : : : ; Fm is a classical procedure that, given any gates G1 ; : : : ; Gm , decides with high probability if each G i is close to F i . This decision has to rely only on measuring in the computational basis the effect of iterating the gates on the classical states. It turns out that instead of individual gates, we can only design procedures for families of gates. To achieve our goal we borrow some... (Update)
Similar documents (at the sentence level):
56.5%: Self-Testing of Universal and Fault-Tolerant Sets of.. - van Dam, Magniez.. (2000) (Correct)
18.5%: On Quantum Computation Theory - van Dam (2002) (Correct)
Active bibliography (related documents): More All
0.5: Quantum Information Processing: Compression, Coding, and Related.. - Reif (1985) (Correct)
0.5: Alternative Computational Models: A Comparison of Biomolecular and .. - Reif (1998) (Correct)
0.4: Quantum Computation - Aharonov (1998) (Correct)
Similar documents based on text: More All
0.2: The Program a2ac - Font Handling on the PostScript Level - Olsak (1995) (Correct)
0.2: Exact and Approximate Testing/Correcting of Algebraic.. - Kiwi, Magniez, Santha (Correct)
0.2: Approximate Testing with Relative Error - Kiwi, Magniez, Santha (1999) (Correct)
BibTeX entry: (Update)
@inproceedings{ vandam00selftesting,
author = "Wim van Dam and Fr{\'e}d{\'e}ic Magniez and Michele Mosca and Miklos Santha",
title = "Self-testing of universal and fault-tolerant sets of quantum gates",
pages = "688--696",
year = "2000",
url = "citeseer.ist.psu.edu/357099.html" }
Citations (may not include all citations):173 Quantum complexity theory - Bernstein, Vazirani - 1997
168 Algorithms for quantum computation: Discrete logarithm and f.. - Shor - 1997
144 the power of quantum computation - Simon - 1997
126 Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992
124 Elementary gates for quantum computation - Barenco, Bennett et al. - 1995
118 the Church-Turing principle and the universal quantum comput.. (context) - Deutsch - 1985
116 Simulating physics with computers - Feynman - 1982
115 Robust characterizations of polynomials with applications to.. - Rubinfeld, Sudan - 1996
92 correcting with applications to numerical problems (context) - Blum, Luby et al. - 1990
90 Quantum cryptography: Public key distribution and coin tossi.. (context) - Bennett, Brassard - 1984
85 Quantum circuit complexity - Yao - 1993
70 Quantum computational networks (context) - Deutsch - 1989
60 correcting for polynomials and for approximate functions (context) - Gemmell, Lipton et al. - 1991
52 Real algebraic and semialgebraic sets (context) - Benedetti, Risler - 1990
49 Two-bit gates are universal for quantum computation - DiVincenzo - 1995
45 Fault-tolerant quantum computation - Shor - 1996
42 The quantum challenge to structural complexity theory - Berthiaume, Brassard - 1992
37 Quantum circuits with mixed states - Aharonov, Kitaev et al. - 1998
33 Fault-tolerant quantum computation with constant error - Aharonov, Ben-Or - 1997
32 Quantum computations: Algorithms and error correction (context) - Kitaev - 1997
28 Scheme for reducing decoherence in quantum computer memory (context) - Shor - 1995
24 Universality in quantum computation - Deutsch, Barenco et al. - 1995
23 of self-checking, self-testing and self-correcting programs (context) - Rubinfeld, theory - 1990
18 A universal two-bit gate for quantum computation (context) - Barenco - 1995
16 Almost any quantum logic gate is universal (context) - Lloyd - 1995
15 Quantum computability (context) - Adleman, Demarrais et al. - 1997
12 the robustness of functional equations - Rubinfeld - 1994
9 Threshold accuracy for quantum computation (context) - Knill, Laflamme et al.
8 Complete characterization of a quantum process: the two-bit .. (context) - Poyatos, Cirac et al. - 1997
8 Resilient quantum computation: error models and thresholds (context) - Knill, Laflamme et al. - 1998
7 On universal and fault-tolerant quantum computing: A novel b.. - Boykin, Mor et al. - 1999
7 Quantum cryptography with imperfect apparatus (context) - Mayers, Yao - 1998
6 Quantum Computing (context) - Preskill
6 Prescription for experimental determination of the dynamics .. - Chuang, Nielsen - 1997
6 of Series in Discrete Mathematics and Theoretical Computer S.. (context) - Lipton, in et al. - 1991
Documents on the same site (http://www.lri.fr/Francais/Recherche/algo/page4/publi.html): More
Spectra with Only Unary Function Symbols - Durand, Fagin, Loescher (1997) (Correct)
Approximate Testing with Relative Error - Kiwi, Magniez, Santha (1999) (Correct)
One Unary Function Says Less Than Two In Existential Second.. - Bernd Loescher (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC