1997/11/20 by Vladimir D. Tonchev, Tonchev, Vladimir D.
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/9711047
paper withdrawn
openalex publication_date 1997/11/20 · arxiv created 1997/12/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper has been withdrawn since a Gilbert-Varshamov bound for general quantum codes has already appeared in Ekert and Macchiavello, Prys. Rev. Lett. 77, p. 2585, and a Gilbert-Varshamov bound for stabilizer codes connected with orthogonal geometry, or equivalently, with symmetric matrices as in this paper, has been proved by Calredbank, Rains, Shor and Sloane, Phys. Rev. Lett. 78, p. 405. I would like to thank Robert Calderbank for pointing out these references to me.