Arbitrarily exhaustive hypergraph generation of 4-, 6-, 8-, 16-, and 32-dimensional quantum contextual sets

Arbitrarily exhaustive hypergraph generation of 4-, 6-, 8-, 16-, and 32-dimensional quantum... Quantum contextuality turns out to be a necessary resource for universal quantum computation and important in the field of quantum information processing. It is therefore of interest both for theoretical considerations and for experimental implementation to find new types and instances of contextual sets and develop methods of their optimal generation. We present an arbitrarily exhaustive hypergraph-based generation of the most explored contextual sets [Kochen-Specker (KS) ones] in 4, 6, 8, 16, and 32 dimensions. We consider and analyze 12 KS classes and obtain numerous properties of theirs, which we then compare with the results previously obtained in the literature. We generate several thousand additional types and instances of KS sets, including all KS sets in three of the classes and the upper part of a fourth set. We make use of the McKay-Megill-Pavičić (MMP) hypergraph language, algorithms, and programs to generate KS sets strictly following their definition from the Kochen-Specker theorem. This approach proves to be particularly advantageous over the parity-proof-based ones (which prevail in the literature) since it turns out that only a very few KS sets have a parity proof (in six KS classes <0.01% and in one of them 0%). MMP hypergraph formalism enables a translation of an exponentially complex task of solving systems of nonlinear equations, describing KS vector orthogonalities, into a statistically linearly complex task of evaluating vertex states of hypergraph edges, thus exponentially speeding up the generation of KS sets and enabling us to generate billions of novel instances of them. The MMP hypergraph notation also enables us to graphically represent KS sets and to visually discern their features. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Physical Review A American Physical Society (APS)

Arbitrarily exhaustive hypergraph generation of 4-, 6-, 8-, 16-, and 32-dimensional quantum contextual sets

Preview Only

Arbitrarily exhaustive hypergraph generation of 4-, 6-, 8-, 16-, and 32-dimensional quantum contextual sets

Abstract

Quantum contextuality turns out to be a necessary resource for universal quantum computation and important in the field of quantum information processing. It is therefore of interest both for theoretical considerations and for experimental implementation to find new types and instances of contextual sets and develop methods of their optimal generation. We present an arbitrarily exhaustive hypergraph-based generation of the most explored contextual sets [Kochen-Specker (KS) ones] in 4, 6, 8, 16, and 32 dimensions. We consider and analyze 12 KS classes and obtain numerous properties of theirs, which we then compare with the results previously obtained in the literature. We generate several thousand additional types and instances of KS sets, including all KS sets in three of the classes and the upper part of a fourth set. We make use of the McKay-Megill-Pavičić (MMP) hypergraph language, algorithms, and programs to generate KS sets strictly following their definition from the Kochen-Specker theorem. This approach proves to be particularly advantageous over the parity-proof-based ones (which prevail in the literature) since it turns out that only a very few KS sets have a parity proof (in six KS classes <0.01% and in one of them 0%). MMP hypergraph formalism enables a translation of an exponentially complex task of solving systems of nonlinear equations, describing KS vector orthogonalities, into a statistically linearly complex task of evaluating vertex states of hypergraph edges, thus exponentially speeding up the generation of KS sets and enabling us to generate billions of novel instances of them. The MMP hypergraph notation also enables us to graphically represent KS sets and to visually discern their features.
Loading next page...
 
/lp/aps_physical/arbitrarily-exhaustive-hypergraph-generation-of-4-6-8-16-and-32-muRZVUiBXl
Publisher
The American Physical Society
Copyright
Copyright © ©2017 American Physical Society
ISSN
1050-2947
eISSN
1094-1622
D.O.I.
10.1103/PhysRevA.95.062121
Publisher site
See Article on Publisher Site

Abstract

Quantum contextuality turns out to be a necessary resource for universal quantum computation and important in the field of quantum information processing. It is therefore of interest both for theoretical considerations and for experimental implementation to find new types and instances of contextual sets and develop methods of their optimal generation. We present an arbitrarily exhaustive hypergraph-based generation of the most explored contextual sets [Kochen-Specker (KS) ones] in 4, 6, 8, 16, and 32 dimensions. We consider and analyze 12 KS classes and obtain numerous properties of theirs, which we then compare with the results previously obtained in the literature. We generate several thousand additional types and instances of KS sets, including all KS sets in three of the classes and the upper part of a fourth set. We make use of the McKay-Megill-Pavičić (MMP) hypergraph language, algorithms, and programs to generate KS sets strictly following their definition from the Kochen-Specker theorem. This approach proves to be particularly advantageous over the parity-proof-based ones (which prevail in the literature) since it turns out that only a very few KS sets have a parity proof (in six KS classes <0.01% and in one of them 0%). MMP hypergraph formalism enables a translation of an exponentially complex task of solving systems of nonlinear equations, describing KS vector orthogonalities, into a statistically linearly complex task of evaluating vertex states of hypergraph edges, thus exponentially speeding up the generation of KS sets and enabling us to generate billions of novel instances of them. The MMP hypergraph notation also enables us to graphically represent KS sets and to visually discern their features.

Journal

Physical Review AAmerican Physical Society (APS)

Published: Jun 26, 2017

There are no references for this article.

Sorry, we don’t have permission to share this article on DeepDyve,
but here are related articles that you can start reading right now:

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

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

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches

$49/month

Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

$588

$360/year

billed annually
Start Free Trial

14-day Free Trial