Related papers: Quantum Contextuality

Quantum Contextuality

URL: http://arxiv.org/abs/2108.00967v4
Date: Mon, 13 Mar 2023 14:07:20 GMT
Title: Quantum Contextuality
Authors: Mladen Pavicic
Abstract summary: Quantum contextual sets are resources for universal quantum computation, quantum steering and quantum communication. Discriminators considered are inequalities defined for hypergraphs whose structure and generation are determined by their basic properties. Results are obtained by making use of universal automated algorithms which generate hypergraphs with both odd and even numbers of hyperedges in any odd and even dimensional space.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Quantum contextual sets have been recognized as resources for universal quantum computation, quantum steering and quantum communication. Therefore, we focus on engineering the sets that support those resources and on determining their structures and properties. Such engineering and subsequent implementation rely on discrimination between statistics of measurement data of quantum states and those of their classical counterparts. The discriminators considered are inequalities defined for hypergraphs whose structure and generation are determined by their basic properties. The generation is inherently random but with the predetermined quantum probabilities of obtainable data. Two kinds of statistics of the data are defined for the hypergraphs and six kinds of inequalities. One kind of statistics, often applied in the literature, turn out to be inappropriate and two kinds of inequalities turn out not to be noncontextuality inequalities. Results are obtained by making use of universal automated algorithms which generate hypergraphs with both odd and even numbers of hyperedges in any odd and even dimensional space - in this paper, from the smallest contextual set with just three hyperedges and three vertices to arbitrarily many contextual sets in up to 8-dimensional spaces. Higher dimensions are computationally demanding although feasible.

Related papers

Quantum Contextual Hypergraphs, Operators, Inequalities, and Applications in Higher Dimensions [0.0]
Quantum contextuality plays a significant role in supporting quantum computation and quantum information theory. This study demonstrates how to generate contextual hypergraphs in any dimension using various methods. We introduce innovative examples of hypergraphs extending to dimension 32.
arXiv Detail & Related papers (2025-01-16T16:27:45Z)
Characterizing quantum state-space with a single quantum measurement [0.0]
We show that quantum theory can be derived from studying the behavior of a single "reference" measuring device. In this privileged case, each quantum state correspond to a probability-distribution over the outcomes of a single measurement. We show how 3-designs allow the structure-coefficients of the Jordan algebra of observables to be extracted from the probabilities which characterize the reference measurement.
arXiv Detail & Related papers (2024-12-18T05:00:45Z)
Multimodal deep representation learning for quantum cross-platform verification [60.01590250213637]
Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms. We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities. We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
arXiv Detail & Related papers (2023-11-07T04:35:03Z)
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)
Characterizing high-dimensional quantum contextuality [1.085294773316861]
Quantum contextuality is an essential resource in many quantum information processing tasks. We provide systematic reliable methods for characterizing quantum contextuality in systems of fixed dimension. As an application, our methods reveal the non-dimensional quantum contextuality structure.
arXiv Detail & Related papers (2022-12-22T09:31:37Z)
Experimental test of high-dimensional quantum contextuality based on contextuality concentration [14.374078593775309]
We show a family of noncontextuality inequalities whose maximum quantum violation grows with the dimension of the system. Our results advance the investigation of high-dimensional contextuality, its connection to the Clifford algebra, and its role in quantum computation.
arXiv Detail & Related papers (2022-09-06T20:20:43Z)
Design of optimization tools for quantum information theory [0.0]
We introduce an algorithm for quantum estate estimation and a technique for certifying quantum non-locality. To study the quantum marginal problem, we develop an algorithm, which takes as inputs a set of quantum marginals and eigenvalues, and outputs a density matrix.
arXiv Detail & Related papers (2022-04-15T19:37:21Z)
Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z)
Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z)
Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
arXiv Detail & Related papers (2021-09-06T14:35:15Z)
On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids [63.75363908696257]
The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$. This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
arXiv Detail & Related papers (2021-06-11T09:43:09Z)
Generalizing optimal Bell inequalities [0.0]
Bell inequalities are central tools for studying nonlocal correlations and their applications in quantum information processing. We develop a method to characterize Bell inequalities under constraints, which may be given by symmetry or other linear conditions. This allows to search systematically for generalizations of given Bell inequalities to more parties.
arXiv Detail & Related papers (2020-05-18T13:11:02Z)
Inaccessible information in probabilistic models of quantum systems, non-contextuality inequalities and noise thresholds for contextuality [0.0]
We quantify the inaccessible information of a model in terms of the maximum distinguishability of probability distributions. These bounds can be interpreted as a new class of robust preparation non-contextuality inequalities.
arXiv Detail & Related papers (2020-03-12T19:23:14Z)

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