Data-driven criteria for quantum correlations
- URL: http://arxiv.org/abs/2307.11091v1
- Date: Thu, 20 Jul 2023 17:59:59 GMT
- Title: Data-driven criteria for quantum correlations
- Authors: Mateusz Krawczyk, Jaros{\l}aw Paw{\l}owski, Maciej M. Ma\'ska, and
Katarzyna Roszak
- Abstract summary: We build a machine learning model to detect correlations in a three-qubit system.
We find that the proposed detector performs much better at distinguishing a weaker form of quantum correlations, namely, the quantum discord, than entanglement.
- Score: 3.1498833540989413
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We build a machine learning model to detect correlations in a three-qubit
system using a neural network trained in an unsupervised manner on randomly
generated states. The network is forced to recognize separable states, and
correlated states are detected as anomalies. Quite surprisingly, we find that
the proposed detector performs much better at distinguishing a weaker form of
quantum correlations, namely, the quantum discord, than entanglement. In fact,
it has a tendency to grossly overestimate the set of entangled states even at
the optimal threshold for entanglement detection, while it underestimates the
set of discordant states to a much lesser extent. In order to illustrate the
nature of states classified as quantum-correlated, we construct a diagram
containing various types of states -- entangled, as well as separable, both
discordant and non-discordant. We find that the near-zero value of the
recognition loss reproduces the shape of the non-discordant separable states
with high accuracy, especially considering the non-trivial shape of this set on
the diagram. The network architecture is designed carefully: it preserves
separability, and its output is equivariant with respect to qubit permutations.
We show that the choice of architecture is important to get the highest
detection accuracy, much better than for a baseline model that just utilizes a
partial trace operation.
Related papers
- Effective detection of quantum discord by using Convolutional Neural
Networks [0.0]
We design a Convolutional Neural Network (CNN) that uses 16 kernels to completely distinguish between discordant and non-discordant general two-qubit states.
A Branching Convolutional Neural Network (BCNN) that can effectively detect quantum discord achieves an accuracy of around 85% or 99%.
arXiv Detail & Related papers (2024-01-15T00:50:22Z) - Correlation-pattern-based Continuous-variable Entanglement Detection
through Neural Networks [1.5091188291530049]
Entanglement in continuous-variable non-Gaussian states provides irreplaceable advantages in many quantum information tasks.
We develop a neural network that allows us to use correlation patterns to effectively detect continuous-variable entanglement.
arXiv Detail & Related papers (2023-10-31T16:00:25Z) - Certification of non-Gaussian Einstein-Podolsky-Rosen Steering [2.9290107337630613]
We present an efficient non-Gaussian steering criterion based on the high-order observables.
We propose a feasible scheme to create multi-component cat states with tunable size.
Our work reveals the fundamental characteristics of non-Gaussianity and quantum correlations.
arXiv Detail & Related papers (2023-08-26T12:57:22Z) - Toward Certified Robustness Against Real-World Distribution Shifts [65.66374339500025]
We train a generative model to learn perturbations from data and define specifications with respect to the output of the learned model.
A unique challenge arising from this setting is that existing verifiers cannot tightly approximate sigmoid activations.
We propose a general meta-algorithm for handling sigmoid activations which leverages classical notions of counter-example-guided abstraction refinement.
arXiv Detail & Related papers (2022-06-08T04:09:13Z) - 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) - Neuro-Symbolic Entropy Regularization [78.16196949641079]
In structured prediction, the goal is to jointly predict many output variables that together encode a structured object.
One approach -- entropy regularization -- posits that decision boundaries should lie in low-probability regions.
We propose a loss, neuro-symbolic entropy regularization, that encourages the model to confidently predict a valid object.
arXiv Detail & Related papers (2022-01-25T06:23:10Z) - Building separable approximations for quantum states via neural networks [0.0]
We parametrize separable states with a neural network and train it to minimize the distance to a given target state.
By examining the output of the algorithm, we can deduce whether the target state is entangled or not, and construct an approximation for its closest separable state.
We show our method to be efficient in the multipartite case, considering different notions of separability.
arXiv Detail & Related papers (2021-12-15T11:50:25Z) - SignalNet: A Low Resolution Sinusoid Decomposition and Estimation
Network [79.04274563889548]
We propose SignalNet, a neural network architecture that detects the number of sinusoids and estimates their parameters from quantized in-phase and quadrature samples.
We introduce a worst-case learning threshold for comparing the results of our network relative to the underlying data distributions.
In simulation, we find that our algorithm is always able to surpass the threshold for three-bit data but often cannot exceed the threshold for one-bit data.
arXiv Detail & Related papers (2021-06-10T04:21:20Z) - Particle Track Classification Using Quantum Associative Memory [0.3058685580689604]
Pattern recognition algorithms are commonly employed to simplify the step of track reconstruction in sub-atomic physics experiments.
We study quantum associative memory based on quantum annealing and apply it to the particle track classification.
We characterize classification performance of these approaches as a function detector resolution, pattern library size, and detector inefficiencies, using the D-Wave 2000Q processor as a testbed.
arXiv Detail & Related papers (2020-11-24T02:32:19Z) - Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values.
We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions.
For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
arXiv Detail & Related papers (2020-08-19T16:04:34Z) - Gaussian Process States: A data-driven representation of quantum
many-body physics [59.7232780552418]
We present a novel, non-parametric form for compactly representing entangled many-body quantum states.
The state is found to be highly compact, systematically improvable and efficient to sample.
It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
arXiv Detail & Related papers (2020-02-27T15:54:44Z)
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.