Asymmetric Quantum Codes on Toric Surfaces

Similar documents
COHOMOLOGY OF THE G-HILBERT SCHEME FOR 1 (1, 1, r 1) Oskar Kȩdzierski

Enumerating permutation polynomials

arxiv: v1 [math.co] 1 Apr 2011

ONE-POINT CODES USING PLACES OF HIGHER DEGREE

New problems in universal algebraic geometry illustrated by boolean equations

The Congestion of n-cube Layout on a Rectangular Grid S.L. Bezrukov J.D. Chavez y L.H. Harper z M. Rottger U.-P. Schroeder Abstract We consider the pr

SOME GENERAL NUMERICAL RADIUS INEQUALITIES FOR THE OFF-DIAGONAL PARTS OF 2 2 OPERATOR MATRICES

Euclidean Figures and Solids without Incircles or Inspheres

2-Monoid of Observables on String G

Bounds for Codimensions of Fitting Ideals

Vanishing lines in generalized Adams spectral sequences are generic

Channel matrix, measurement matrix and collapsed matrix. in teleportation

Geometry of the homogeneous and isotropic spaces

COLLAPSING WALLS THEOREM

The geometric construction of Ewald sphere and Bragg condition:

Lifting Private Information Retrieval from Two to any Number of Messages

The height of minimal Hilbert bases

Hua Xu 3 and Hiroaki Mukaidani 33. The University of Tsukuba, Otsuka. Hiroshima City University, 3-4-1, Ozuka-Higashi

Available online through ISSN

AQI: Advanced Quantum Information Lecture 2 (Module 4): Order finding and factoring algorithms February 20, 2013

Solving Some Definite Integrals Using Parseval s Theorem

Mean Curvature and Shape Operator of Slant Immersions in a Sasakian Space Form

10/04/18. P [P(x)] 1 negl(n).

Liquid gas interface under hydrostatic pressure

Complements of plane curves with logarithmic Kodaira dimension zero

Central Coverage Bayes Prediction Intervals for the Generalized Pareto Distribution

Chapter 5 Linear Equations: Basic Theory and Practice

SPECTRAL SEQUENCES. im(er

Gradient-based Neural Network for Online Solution of Lyapunov Matrix Equation with Li Activation Function

KOEBE DOMAINS FOR THE CLASSES OF FUNCTIONS WITH RANGES INCLUDED IN GIVEN SETS

Fixed Argument Pairing Inversion on Elliptic Curves

Using Laplace Transform to Evaluate Improper Integrals Chii-Huei Yu

is the instantaneous position vector of any grid point or fluid

Fall 2014 Randomized Algorithms Oct 8, Lecture 3

Stanford University CS259Q: Quantum Computing Handout 8 Luca Trevisan October 18, 2012

Transformations in Homogeneous Coordinates

Research Article On Alzer and Qiu s Conjecture for Complete Elliptic Integral and Inverse Hyperbolic Tangent Function

New Finding on Factoring Prime Power RSA Modulus N = p r q

Construction and Analysis of Boolean Functions of 2t + 1 Variables with Maximum Algebraic Immunity

On a Hyperplane Arrangement Problem and Tighter Analysis of an Error-Tolerant Pooling Design

Application of Parseval s Theorem on Evaluating Some Definite Integrals

Galilean Transformation vs E&M y. Historical Perspective. Chapter 2 Lecture 2 PHYS Special Relativity. Sep. 1, y K K O.

ON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS. D.A. Mojdeh and B. Samadi

ON INDEPENDENT SETS IN PURELY ATOMIC PROBABILITY SPACES WITH GEOMETRIC DISTRIBUTION. 1. Introduction. 1 r r. r k for every set E A, E \ {0},

Quantum theory of angular momentum

PROBLEM SET #1 SOLUTIONS by Robert A. DiStasio Jr.

THE MAXIMUM SIZE OF A PARTIAL SPREAD II: UPPER BOUNDS

On Continued Fraction of Order Twelve

Vector d is a linear vector function of vector d when the following relationships hold:

Multiple Criteria Secretary Problem: A New Approach

Many Electron Atoms. Electrons can be put into approximate orbitals and the properties of the many electron systems can be catalogued

CONSTRUCTION OF EQUIENERGETIC GRAPHS

Topic 3: Spacetime Geometry and Clifford Algebras

PHYS 110B - HW #7 Spring 2004, Solutions by David Pace Any referenced equations are from Griffiths Problem statements are paraphrased

2 x 8 2 x 2 SKILLS Determine whether the given value is a solution of the. equation. (a) x 2 (b) x 4. (a) x 2 (b) x 4 (a) x 4 (b) x 8

HOW TO TEACH THE FUNDAMENTALS OF INFORMATION SCIENCE, CODING, DECODING AND NUMBER SYSTEMS?

9.1 The multiplicative group of a finite field. Theorem 9.1. The multiplicative group F of a finite field is cyclic.

On Polynomials Construction

Hammerstein Model Identification Based On Instrumental Variable and Least Square Methods

Asymptotically Lacunary Statistical Equivalent Sequence Spaces Defined by Ideal Convergence and an Orlicz Function

YUXIANG LI DEPARTMENT OF MATHEMATICAL SCIENCES, TSINGHUA UNIVERSITY, BEIJING , P.R.CHINA.

Duality between Statical and Kinematical Engineering Systems

Analytical Solutions for Confined Aquifers with non constant Pumping using Computer Algebra

Chaos and bifurcation of discontinuous dynamical systems with piecewise constant arguments

b Ψ Ψ Principles of Organic Chemistry lecture 22, page 1

Do Managers Do Good With Other People s Money? Online Appendix

(n 1)n(n + 1)(n + 2) + 1 = (n 1)(n + 2)n(n + 1) + 1 = ( (n 2 + n 1) 1 )( (n 2 + n 1) + 1 ) + 1 = (n 2 + n 1) 2.

Suborbital graphs for the group Γ 2

Web-based Supplementary Materials for. Controlling False Discoveries in Multidimensional Directional Decisions, with

A STUDY OF HAMMING CODES AS ERROR CORRECTING CODES

Lecture 25: Pairing Based Cryptography

Psychometric Methods: Theory into Practice Larry R. Price

EM Boundary Value Problems

Measure Estimates of Nodal Sets of Polyharmonic Functions

On decompositions of complete multipartite graphs into the union of two even cycles

On the Number of Rim Hook Tableaux. Sergey Fomin* and. Nathan Lulov. Department of Mathematics. Harvard University

SOME SOLVABILITY THEOREMS FOR NONLINEAR EQUATIONS

Revision of Lecture Eight

Applied Aerodynamics

Absorption Rate into a Small Sphere for a Diffusing Particle Confined in a Large Sphere

Math 2263 Solutions for Spring 2003 Final Exam

NOTE. Some New Bounds for Cover-Free Families

A generalization of the Bernstein polynomials

Localization of Eigenvalues in Small Specified Regions of Complex Plane by State Feedback Matrix

q i i=1 p i ln p i Another measure, which proves a useful benchmark in our analysis, is the chi squared divergence of p, q, which is defined by

Temporal-Difference Learning

The Archimedean Circles of Schoch and Woo

Moment-free numerical approximation of highly oscillatory integrals with stationary points

Vectors, Vector Calculus, and Coordinate Systems

TOPOLOGICAL DIVISOR OF ZERO PERTURBATION FUNCTIONS

PHYS 1114, Lecture 21, March 6 Contents:

Field emission of Electrons from Negatively Charged Cylindrical Particles with Nonlinear Screening in a Dusty Plasma

arxiv: v1 [math.na] 8 Feb 2013

ON LACUNARY INVARIANT SEQUENCE SPACES DEFINED BY A SEQUENCE OF MODULUS FUNCTIONS

Model and Controller Order Reduction for Infinite Dimensional Systems

Chapter 3: Theory of Modular Arithmetic 38

COMPUTATIONS OF ELECTROMAGNETIC FIELDS RADIATED FROM COMPLEX LIGHTNING CHANNELS

Weighted least-squares estimators of parametric functions of the regression coefficients under a general linear model

On the Inradius of a Tangential Quadrilateral

Physics 235 Chapter 5. Chapter 5 Gravitation

Transcription:

Institute of Mathematics Aahus Univesity Octobe 1, 2017

Abstact Asymmetic quantum eo-coecting codes ae quantum codes defined ove biased quantum channels: qubit-flip and phase-shift eos may have equal o diffeent pobabilities. The code constuction is the Caldebank-Sho-Steane constuction based on two linea codes. We pesent families of toic sufaces, toic codes and associated asymmetic quantum eo-coecting codes.

Backgound on quantum eo-coecting codes Woks of P.W. Sho [17] and A.M. Steane [23], [19] initiated the study and constuction of quantum eo-coecting codes. A.R. Caldebank [5], P.W. Sho [18] and A.M. Steane [22] poduced stabilize codes (CSS) fom linea codes containing thei dual codes. Fo details see fo example [2], [4] and [24].

Toic codes Intoduction In [9] and [10] we developed methods to constuct linea eo coecting codes fom toic vaieties. In [11] we genealized this to constuct linea codes suitable fo constucting quantum codes by the Caldebank-Sho-Steane method. Ou constuctions extended simila esults obtained by A. Ashikhmin, S. Litsyn and M.A. Tsfasman in [3] fom Goppa codes on algebaic cuves.

Asymmetic quantum eo-coecting codes Asymmetic quantum eo-coecting codes ae quantum codes defined ove biased quantum channels: qubit-flip and phase-shift eos may have equal o diffeent pobabilities. The code constuction is the CSS constuction based on two linea codes. The constuction appeaed oiginally in [7], [13] and [25]. We pesent new families of toic sufaces, toic codes and associated asymmetic quantum eo-coecting codes.

Fo the geneal theoy of toic vaieties we efe to [6], [8] and [15]. Let F q be the field with q elements and let be an intege dividing q. Let b Z such that 0 b q 2 with a := b + q 2 q 2. Let b in M R be the 2-dimensional integal convex polytope in M R with vetices (0, 0), (a, 0), (b, q 2) and (0, q 2) popely contained in the squae [0, q 2] [0, q 2], see Figue 1. It is the Minkowski sum of the line segment fom (0, 0) to (b, 0) and the polytope 0, see Figue 2.

The polytope b q 2 b q 2 a = b + q 2 Figue: The polytope b is the polytope with vetices (0, 0), (a = b + q 2, 0), (b, q 2), (0, q 2).

The polytope 0 q 2 q 2 a = q 2 Figue: The polytope 0 is the polytope with vetices (0, 0), (a = q 2, 0), (0, q 2).

The efined nomal fan V (ρ 4 ) V (ρ 3 ) V (ρ 2 ) V (ρ 1 ) Figue: The efined nomal fan and the 1-dimensional cones of the polytope 0 in Figue 2

The 1-dimensional cones in the efined nomal fan 0 of the polytope 0 ae geneated by unique pimitive elements n(ρ) such that ρ = R 0 n(ρ), specifically ae ) ) ) ) n ρ1 = ( 1 0, n ρ2 = ( 0 1, n ρ3 = ( 1 0, n ρ4 = ( 1, (1) see Figue 3.

Thee ae fou 2-dimensional cones in the efined nomal fan 0 : ( ) 0 1 σ 1 with faces ρ 1, ρ 2 and l σ1 = 0 ) 2 σ 2 with faces ρ 2, ρ 3 and l σ1 = ( q 2 0 ( q 2 3 σ 3 with faces ρ 3, ρ 4 and l σ1 = 0 ( ) 0 4 σ 4 with faces ρ 4, ρ 1 and l σ1 =. q 2 )

Let M be an intege lattice M Z 2. LetN = Hom Z (M, Z) be the dual lattice. The 2-dimensional algebaic tous T N k k is defined by T N := Hom Z (M, k ). The multiplicative chaacte e(m), m M is the homomophism e(m) : T k defined by e(m)(t) = t(m) fo t T N. Specifically, if {n 1, n 2 } and {m 1, m 2 } ae dual Z-bases of N and M and we denote u j := e(m j ), j = 1, 2, then we have an isomophism T N k k sending t to (u 1 (t), u 2 (t)). Fo m = λ 1 m 1 + λ 2 m 2 we have e(m)(t) = u 1 (t) λ 1 u 2 (t) λ 2. (2) The toic suface X b associated to the nomal fan b of b is X b = σ U σ, whee U σ is the k-valued points of the affine scheme Spec(k[S σ ]), i.e., mophisms u : S σ k with u(0) = 1 and u(m + m ) = u(m)u(m ) m, m S σ, whee S σ is the additive subsemigoup of M.

Toic code Intoduction Definition Fo each t T k k, we evaluate the ational functions in H 0 (X b, O X (D b )) H 0 (X b, O X (D b )) k f f (t). Let H 0 (X b, O X (D b )) Fob denote the ational functions in H 0 (X b, O X (D b )) that ae invaiant unde the action of the Fobenius, i.e. functions that ae F q -linea combinations of the functions e(m) in (2). Evaluating in all points in S = F q F q X b, we obtain the code C b (F q ) #S as the image H 0 (X b, O X (D h )) Fob C b (F q ) #S (3)

Paametes Intoduction Theoem Let F q be the field with q elements and let be an intege dividing q. Let b Z such that 0 b q 2 with a := b + q 2 q 2. Let b in M R be the 2-dimensional integal convex polytope in M R with vetices (0, 0), (a, 0), (b, q 2) and (0, q 2) contained in the squae [0, q 2] [0, q 2], see Figue 1. Let C b be the coesponding toic code of (3). Then n := length( C b = (q) 1) 2 and k = dim C b = 1 q 2 2 + 1 q + b(q 1) and the minimum distance d(c b ) = (q 1 a)(q 1).

Notation Intoduction Let H be the Hilbet space H = C qn = C q C q... C q. Let x, x F q be an othonomal basis fo C q. Fo a, b F q, the unitay opeatos X (a) and Z(b) in C q ae X (a)x = x + a, Z(b)x = ω t(bx) x, (5) whee ω = exp(2πi/p) is a pimitive pth oot of unity and t is the tace opeation fom F q to F p. Fo a = (a 1,..., a n ) F n q and b = (b 1,..., b n ) F n q X (a) = X (a 1 ) X (a n ) Z(b) = Z(b 1 ) Z(b n ) ae the tenso poducts of n eo opeatos. With n E x = {X (a) = X (a i ) a F n q, a i F q }, i=1 n

Eo goups Intoduction The eo goups G x and G z ae G x = {ω c E x = ω c X (a) a F n q, c F p }, G z = {ω c E z = ω c Z(b) b F q nc F p }. It is assumed that the goups G x and G z epesent the qubit-flip and phase-shift eos.

Asymmetic quantum code Definition (Asymmetic quantum code) A q-ay asymmetic quantum code Q, denoted by [[n, k, d z /d x ]] q, is a q k dimensional subspace of the Hilbet space C qn and can dx 1 contol all bit-flip eos up to 2 and all phase-flip eos up dz 1 to 2. The code Q detects (d x 1) qubit-flip eos as well as detects (d z 1) phase-shift eos.

Let C 1 and C 2 be two linea eo-coecting codes ove the finite field F q, and let [n, k 1, d 1 ] q and [n, k 2, d 2 ] q be thei paametes. Fo the dual codes Ci, we have dim Ci = n k i and if C1 C 2 then C2 C 1. Lemma Let C i fo i = 1, 2 be linea eo-coecting codes with paametes [n, k i, d i ] q such that C1 C 2 and C2 C 1. Let d x = min { wt(c 1 \C2 ), wt(c 2\C1 )}, and d z = max { wt(c 1 \C2 ), wt(c 2\C1 )}. Then thee is an asymmetic quantum code with paametes [[n, k 1 + k 2 n, d z /d x ]] q. The quantum code is pue to its minimum distance, meaning that if wt(c 1 ) = wt(c 1 \C2 ), then the code is pue to d x, also if wt(c 2 ) = wt(c 2 \C1 ), then the code is pue to d z.

This constuction is well-known, see fo example [2], [4], [17], [23], [20], [21] [1]. The eo goups G x and G z can be mapped to the linea codes C 1 and C 2.

Let F q be the field with q elements and let be an intege dividing q. Let b Z such that 0 b ( 1)(q 2). The polytope b with vetices (0, 0), (a = b + q 2 ), (b, q 2), (0, q 2) is contained in [0, q 2] [0, q 2]. Conside the associated toic code C b of (3). Fom wok of Ruano [16, Theoem 6] we conclude that the dual code Cb is the toic code associated to the polytope b with vetices (0, 0), (a = b + q 2 ), (b, q 2), (0, q 2) whee b = ( 1)(q 2) b, such that a = q 2 b.

Fo i = 1, 2 let b i Z with 0 b i ( 1)(q 2) and b 1 + b 2 ( 1)(q 2). We have the inclusions of polytopes b b1 and 2 b b2, see Fig. 4, and coesponding 1 inclusions of the associated toic codes of (3): C b 2 = C b 2 C b1, C b 1 = C b 1 C b2. The nested codes gives by the constuction of Lemma 1 and the discussion above ise to an asymmetic quantum code Q b1,b 2.

Theoem (Asymmetic quatum codes Q b1,b 2 ) Let F q be the field with q elements and let be an intege dividing q. Fo i = 1, 2 let b i, a i = b i + q 2 Z 0 b i ( 1)(q 2) and b 1 + b 2 ( 1)(q 2). Then thee is ( an asymmetic ) quantum code Q b1,b 2 with paametes [[(q 1) 2, 1 q 2 2 + 1 q + (b 1 + b 2 )(q 1), d z /d x ]] q, whee d z = (q 1 min{b 1, b 2 })(q 1) d x = (q 1 max{b 1, b 2 })(q 1) If b 1 + b 2 ( 1)(q 2) the quantum code is pue to d x and d z.

Poof. The paametes and claims follow diectly fom Lemma 1 and Theoem 2.

q 2 b 2 b 1 b 1 b 2 q 2 0 0 a2 a 1 a a 2 1 Figue: The polytope bi is the polytope with vetices (0, 0), (a i = b i + q 2, 0), (b i, q 2), (0, q 2). The polytopes giving the dual toic codes have vetices (0, 0), (a = b + q 2, 0), Johan(b P. Hansen, q 2), Asymmetic (0, q 2), Quantum whee Codesb on Toic = qsufaces 2 a i.

S. A. Aly and A. Ashikhmin, Nonbinay quantum cyclic and subsystem codes ove asymmetically-decoheed quantum channels, 2010 IEEE Infomation Theoy Wokshop on Infomation Theoy (ITW 2010, Caio), Jan 2010, pp. 1 5. A. Ashikhmin and E. Knill, Nonbinay quantum stabilize codes, IEEE Tansactions on Infomation Theoy 47 (2001), no. 7, 3065 3072. A. Ashikhmin, S. Litsyn, and M.A. Tsfasman, Asymptotically good quantum codes, Physical Review A - Atomic, Molecula, and Optical Physics 63 (2001), no. 3, 1 5. A. Robet Caldebank, Eic M. Rains, P. W. Sho, and Neil J. A. Sloane, Quantum eo coection via codes ove GF(4), IEEE Tans. Infom. Theoy 44 (1998), no. 4, 1369 1387. MR 1665774

A.R. Caldebank and P.W. Sho, Good quantum eo-coecting codes exist, Physical Review A - Atomic, Molecula, and Optical Physics 54 (1996), no. 2, 1098 1105. David A. Cox, John B. Little, and Heny K. Schenck, Toic vaieties, Gaduate Studies in Mathematics, vol. 124, Ameican Mathematical Society, Povidence, RI, 2011. MR 2810322 Z. W. E. Evans, A. M. Stephens, J. H. Cole, and L. C. L. Hollenbeg, Eo coection optimisation in the pesence of X/Z asymmety, AXiv e-pints (2007). William Fulton, Intoduction to toic vaieties, Annals of Mathematics Studies, vol. 131, Pinceton Univesity Pess, Pinceton, NJ, 1993, The William H. Roeve Lectues in Geomety. MR 1234037 (94g:14028), Toic sufaces and eo-coecting codes, Coding theoy, cyptogaphy and elated aeas (Guanajuato,

1998), Spinge, Belin, 2000, pp. 132 142. MR 1749454 (2000m:94036), Toic vaieties Hizebuch sufaces and eo-coecting codes, Appl. Algeba Engg. Comm. Comput. 13 (2002), no. 4, 289 300., Quantum codes fom toic sufaces, IEEE Tans. Infom. Theoy 59 (2013), no. 2, 1188 1192. MR 3015727 Søen Have Hansen, Eo-coecting codes fom highe-dimensional vaieties, Finite Fields Appl. 7 (2001), no. 4, 531 552. MR 1866342 (2003d:94121) Lev Ioffe and Mac Mézad, Asymmetic quantum eo-coecting codes, Phys. Rev. A 75 (2007), 032345.

John Little and Hal Schenck, Toic suface codes and Minkowski sums, SIAM J. Discete Math. 20 (2006), no. 4, 999 1014 (electonic). MR 2272243 Tadao Oda, Convex bodies and algebaic geomety, Egebnisse de Mathematik und ihe Genzgebiete (3) [Results in Mathematics and Related Aeas (3)], vol. 15, Spinge-Velag, Belin, 1988, An intoduction to the theoy of toic vaieties, Tanslated fom the Japanese. MR 922894 (88m:14038) Diego Ruano, On the stuctue of genealized toic codes, J. Symb. Comput. 44 (2009), no. 5, 499 506. Pete W. Sho, Scheme fo educing decoheence in quantum compute memoy, Phys. Rev. A 52 (1995), R2493 R2496., Fault-toleant quantum computation, 37th Annual Symposium on Foundations of Compute Science (Bulington,

VT, 1996), IEEE Comput. Soc. Pess, Los Alamitos, CA, 1996, pp. 56 65. MR 1450603 A. M. Steane, Eo coecting codes in quantum theoy, Phys. Rev. Lett. 77 (1996), no. 5, 793 797. MR 1398854, Simple quantum eo-coecting codes, Phys. Rev. A 54 (1996), 4741 4751. A. M. Steane, Quantum eed-mulle codes, IEEE Tansactions on Infomation Theoy 45 (1999), no. 5, 1701 1703. A.M. Steane, Enlagement of caldebank-sho-steane quantum codes, IEEE Tansactions on Infomation Theoy 45 (1999), no. 7, 2492 2495. Andew Steane, Multiple-paticle intefeence and quantum eo coection, Poc. Roy. Soc. London Se. A 452 (1996), no. 1954, 2551 2577. MR 1421749

Andew M. Steane, Quantum eo coection, Intoduction to quantum computation and infomation, Wold Sci. Publ., Rive Edge, NJ, 1998, pp. 184 212. MR 1750540 Ashley M. Stephens, Zachay W. E. Evans, Simon J. Devitt, and Lloyd C. L. Hollenbeg, Asymmetic quantum eo coection via code convesion, Phys. Rev. A 77 (2008), 062335.