Semidefinite programming relaxations for quantum correlations
- URL: http://arxiv.org/abs/2307.02551v3
- Date: Fri, 16 Feb 2024 10:57:56 GMT
- Title: Semidefinite programming relaxations for quantum correlations
- Authors: Armin Tavakoli, Alejandro Pozas-Kerstjens, Peter Brown, Mateus
Ara\'ujo
- Abstract summary: We discuss how the core idea of semidefinite relaxations can be adapted for a variety of research topics in quantum correlations.
These topics include nonlocality, quantum communication, quantum networks, entanglement, and quantum cryptography.
- Score: 45.84205238554709
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Semidefinite programs are convex optimisation problems involving a linear
objective function and a domain of positive semidefinite matrices. Over the
last two decades, they have become an indispensable tool in quantum information
science. Many otherwise intractable fundamental and applied problems can be
successfully approached by means of relaxation to a semidefinite program. Here,
we review such methodology in the context of quantum correlations. We discuss
how the core idea of semidefinite relaxations can be adapted for a variety of
research topics in quantum correlations, including nonlocality, quantum
communication, quantum networks, entanglement, and quantum cryptography.
Related papers
- What is computable and non-computable in the quantum domain: 7 statements and 3 conjectures [0.7892577704654171]
There is no universal approach that helps to define a scope of problems that quantum computers are able to speed up.
On the one hand, the class of quantum states that is of interest for quantum computing should be complex.
On the other hand, such quantum states should be reachable on a practical quantum computer.
arXiv Detail & Related papers (2024-03-25T15:47:35Z) - 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) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - A Practitioner's Guide to Quantum Algorithms for Optimisation Problems [0.0]
NP-hard optimisation problems are common in industrial areas such as logistics and finance.
This paper aims to provide a comprehensive overview of the theory of quantum optimisation techniques.
It focuses on their near-term potential for noisy intermediate scale quantum devices.
arXiv Detail & Related papers (2023-05-12T08:57:36Z) - Complete characterization of quantum correlations by randomized
measurements [0.832184180529969]
We provide a method to measure any locally invariant property of quantum states using locally randomized measurements.
We implement these methods experimentally using pairs of entangled photons, characterizing their usefulness for quantum teleportation.
Our results can be applied to various quantum computing platforms, allowing simple analysis of correlations between arbitrary distant qubits.
arXiv Detail & Related papers (2022-12-15T15:22:28Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - A thorough introduction to non-relativistic matrix mechanics in
multi-qudit systems with a study on quantum entanglement and quantum
quantifiers [0.0]
This article provides a deep and abiding understanding of non-relativistic matrix mechanics.
We derive and analyze the respective 1-qubit, 1-qutrit, 2-qubit, and 2-qudit coherent and incoherent density operators.
We also address the fundamental concepts of quantum nondemolition measurements, quantum decoherence and, particularly, quantum entanglement.
arXiv Detail & Related papers (2021-09-14T05:06:47Z) - 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) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z)
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.