Testing Quantum Contextuality of Binary Symplectic Polar Spaces on a Noisy Intermediate Scale Quantum Computer

• URL: http://arxiv.org/abs/2101.03812v1
• Date: Mon, 11 Jan 2021 10:55:34 GMT
• Title: Testing Quantum Contextuality of Binary Symplectic Polar Spaces on a Noisy Intermediate Scale Quantum Computer
• Authors: Fr\'ed\'eric Holweck
• Abstract summary: Noisy Intermediate Scale Quantum Computers (NISQC) provides for the Quantum Information community new tools to perform quantum experiences from an individual laptop. It facilitates interdisciplinary research in the sense that theoretical descriptions of properties of quantum physics can be translated to experiments easily implementable on a NISCQ.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The development of Noisy Intermediate Scale Quantum Computers (NISQC) provides for the Quantum Information community new tools to perform quantum experiences from an individual laptop. It facilitates interdisciplinary research in the sense that theoretical descriptions of properties of quantum physics can be translated to experiments easily implementable on a NISCQ. In this note I test large state-independent inequalities for quantum contextuality on finite geometric structures encoding the commutation relations of the generalized N-qubit Pauli group. The bounds predicted by Non-Contextual Hidden Variables theories are strongly violated in all conducted experiences.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Character Complexity: A Novel Measure for Quantum Circuit Analysis [0.0]
  This paper introduces Character Complexity, a novel measure that bridges Group-theoretic concepts with practical quantum computing concerns. I prove several key properties of character complexity and establish a surprising connection to the classical simulability of quantum circuits. I present innovative visualization methods for character complexity, providing intuitive insights into the structure of quantum circuits.
  arXiv  Detail & Related papers  (2024-08-19T01:58:54Z)
• Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
  The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process. We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable. Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs. We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-05-12T09:05:13Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Experimental optical simulator of reconfigurable and complex quantum environment [0.0]
  We demonstrate an optical simulator of a quantum system coupled to an arbitrary and reconfigurable environment. We experimentally retrieve typical features of open quantum system dynamics. This opens the way to the experimental tests of open quantum systems in reconfigurable environments.
  arXiv  Detail & Related papers  (2023-02-24T14:55:49Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Probably approximately correct quantum source coding [0.0]
  Holevo's and Nayak's bounds give an estimate of the amount of classical information that can be stored in a quantum state. We show two novel applications in quantum learning theory and delegated quantum computation with a purely classical client.
  arXiv  Detail & Related papers  (2021-12-13T17:57:30Z)
• Solving hadron structures using the basis light-front quantization approach on quantum computers [0.8726465590483234]
  We show that quantum computing can be used to solve for the structure of hadrons governed by strongly-interacting quantum field theory. We present the numerical calculations on simulated quantum devices using the basis light-front quantization approach.
  arXiv  Detail & Related papers  (2021-12-03T14:28:18Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Probing the limits of quantum theory with quantum information at subnuclear scales [0.13844779265721088]
  We propose a new theoretical framework of Q-data tests. It recognises the established validity of quantum theory, but allows for more general -- 'post-quantum' -- scenarios in certain physical regimes.
  arXiv  Detail & Related papers  (2021-03-22T16:47:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.