Quantum networks self-test all entangled states
- URL: http://arxiv.org/abs/2201.05032v1
- Date: Thu, 13 Jan 2022 15:38:12 GMT
- Title: Quantum networks self-test all entangled states
- Authors: Ivan \v{S}upi\'c, Joseph Bowles, Marc-Olivier Renou, Antonio Ac\'in,
Matty J. Hoban
- Abstract summary: Certifying quantum properties with minimal assumptions is a fundamental problem in quantum information science.
We introduce a framework for network-assisted self-testing and use it to self-test any pure entangled quantum state of an arbitrary number of systems.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Certifying quantum properties with minimal assumptions is a fundamental
problem in quantum information science. Self-testing is a method to infer the
underlying physics of a quantum experiment only from the measured statistics.
While all bipartite pure entangled states can be self-tested, little is known
about how to self-test quantum states of an arbitrary number of systems. Here,
we introduce a framework for network-assisted self-testing and use it to
self-test any pure entangled quantum state of an arbitrary number of systems.
The scheme requires the preparation of a number of singlets that scales
linearly with the number of systems, and the implementation of standard
projective and Bell measurements, all feasible with current technology. When
all the network constraints are exploited, the obtained self-testing
certification is stronger than what is achievable in any Bell-type scenario.
Our work does not only solve an open question in the field, but also shows how
properly designed networks offer new opportunities for the certification of
quantum phenomena.
Related papers
- Self-testing memory-bounded quantum computers [0.1874930567916036]
In a single-device setup, we propose a protocol called quantum system quizzing.
This protocol achieves self-testing of an entire quantum model given by state preparation, gates, and measurement in a black-box scenario.
We identify sets of instructions which self-test multi-qubit universal gate sets for arbitrary numbers of qubits, delivering the first sound certification tool for memory-bounded quantum computers.
arXiv Detail & Related papers (2024-11-06T19:23:45Z) - A computational test of quantum contextuality, and even simpler proofs of quantumness [43.25018099464869]
We show that an arbitrary contextuality game can be compiled into an operational "test of contextuality" involving a single quantum device.
Our work can be seen as using cryptography to enforce spatial separation within subsystems of a single quantum device.
arXiv Detail & Related papers (2024-05-10T19:30:23Z) - Certifying almost all quantum states with few single-qubit measurements [0.9558392439655012]
We show that almost all n-qubit target states can be certified from only O(n2) single-qubit measurements.
We show that such verified representations can be used to efficiently predict highly non-local properties.
arXiv Detail & Related papers (2024-04-10T18:21:11Z) - QuanTest: Entanglement-Guided Testing of Quantum Neural Network Systems [45.18451374144537]
Quantum Neural Network (QNN) combines the Deep Learning (DL) principle with the fundamental theory of quantum mechanics to achieve machine learning tasks with quantum acceleration.
QNN systems differ significantly from traditional quantum software and classical DL systems, posing critical challenges for QNN testing.
We propose QuanTest, a quantum entanglement-guided adversarial testing framework to uncover potential erroneous behaviors in QNN systems.
arXiv Detail & Related papers (2024-02-20T12:11:28Z) - Measurement-Device-Independent Detection of Beyond-Quantum State [53.64687146666141]
We propose a measurement-device-independent (MDI) test for beyond-quantum state detection.
We discuss the importance of tomographic completeness of the input sets to the detection.
arXiv Detail & Related papers (2023-12-11T06:40:13Z) - A universal scheme to self-test any quantum state and extremal measurement [41.94295877935867]
quantum network considered in this work is the simple star network, which is implementable using current technologies.
For our purposes, we also construct a scheme that can be used to self-test the two-dimensional tomographically complete set of measurements with an arbitrary number of parties.
arXiv Detail & Related papers (2023-12-07T16:20:28Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - Certification of entangled quantum states and quantum measurements in
Hilbert spaces of arbitrary dimension [0.0]
Device-independent (DI) certification of composite quantum systems has attracted considerable attention lately.
In this thesis, we construct schemes to device-independently certify quantum states and quantum measurements in Hilbert spaces of arbitrary dimension.
arXiv Detail & Related papers (2023-02-02T18:54:51Z) - Quantum Federated Learning with Quantum Data [87.49715898878858]
Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems.
This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
arXiv Detail & Related papers (2021-05-30T12:19:27Z) - Device-Independent Certification of Genuinely Entangled Subspaces [0.0]
We introduce the concept of self-testing more general entanglement structures.
We show that all quantum states maximally violating a suitably chosen Bell inequality must belong to the corresponding code subspace.
arXiv Detail & Related papers (2020-03-04T19:02:29Z)
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.