Construction of quantum caps in projective space PG(r,4) and quantum codes of distance 4

Construction of quantum caps in projective space PG(r,4) and quantum codes of distance 4 Constructions of quantum caps in projective space PG(r, 4) by recursive methods and computer search are discussed. For each even n satisfying $$n\ge 282$$ n ≥ 282 and each odd z satisfying $$z\ge 275$$ z ≥ 275 , a quantum n-cap and a quantum z-cap in $$PG(k-1, 4)$$ P G ( k - 1 , 4 ) with suitable k are constructed, and $$[[n,n-2k,4]]$$ [ [ n , n - 2 k , 4 ] ] and $$[[z,z-2k,4]]$$ [ [ z , z - 2 k , 4 ] ] quantum codes are derived from the constructed quantum n-cap and z-cap, respectively. For $$n\ge 282$$ n ≥ 282 and $$n\ne 286$$ n ≠ 286 , 756 and 5040, or $$z\ge 275$$ z ≥ 275 , the results on the sizes of quantum caps and quantum codes are new, and all the obtained quantum codes are optimal codes according to the quantum Hamming bound. While constructing quantum caps, we also obtain many large caps in PG(r, 4) for $$r\ge 11$$ r ≥ 11 . These results concerning large caps provide improved lower bounds on the maximal sizes of caps in PG(r, 4) for $$r\ge 11$$ r ≥ 11 . http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Construction of quantum caps in projective space PG(r,4) and quantum codes of distance 4

Loading next page...
 
/lp/springer_journal/construction-of-quantum-caps-in-projective-space-pg-r-4-and-quantum-rnVYd5TDeQ
Publisher
Springer US
Copyright
Copyright © 2015 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-015-1204-9
Publisher site
See Article on Publisher Site

Abstract

Constructions of quantum caps in projective space PG(r, 4) by recursive methods and computer search are discussed. For each even n satisfying $$n\ge 282$$ n ≥ 282 and each odd z satisfying $$z\ge 275$$ z ≥ 275 , a quantum n-cap and a quantum z-cap in $$PG(k-1, 4)$$ P G ( k - 1 , 4 ) with suitable k are constructed, and $$[[n,n-2k,4]]$$ [ [ n , n - 2 k , 4 ] ] and $$[[z,z-2k,4]]$$ [ [ z , z - 2 k , 4 ] ] quantum codes are derived from the constructed quantum n-cap and z-cap, respectively. For $$n\ge 282$$ n ≥ 282 and $$n\ne 286$$ n ≠ 286 , 756 and 5040, or $$z\ge 275$$ z ≥ 275 , the results on the sizes of quantum caps and quantum codes are new, and all the obtained quantum codes are optimal codes according to the quantum Hamming bound. While constructing quantum caps, we also obtain many large caps in PG(r, 4) for $$r\ge 11$$ r ≥ 11 . These results concerning large caps provide improved lower bounds on the maximal sizes of caps in PG(r, 4) for $$r\ge 11$$ r ≥ 11 .

Journal

Quantum Information ProcessingSpringer Journals

Published: Dec 11, 2015

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off