Correlations for computation and computation for correlations
- URL: http://arxiv.org/abs/2005.01780v1
- Date: Mon, 4 May 2020 18:33:13 GMT
- Title: Correlations for computation and computation for correlations
- Authors: B\"ulent Demirel, Weikai Weng, Christopher Thalacker, Matty Hoban, and
Stefanie Barz
- Abstract summary: We connect quantum correlations with computation using 4-photon Greenberger-Horne-Zeilinger (GHZ) states.
We show how the generated states can be used to specifically compute Boolean functions.
The connection between quantum correlation and computability shown here has applications in quantum technologies.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum correlations are central to the foundations of quantum physics and
form the basis of quantum technologies. Here, our goal is to connect quantum
correlations and computation: using quantum correlations as a resource for
computation - and vice versa, using computation to test quantum correlations.
We derive Bell-type inequalities that test the capacity of quantum states for
computing Boolean functions and experimentally investigate them using 4-photon
Greenberger-Horne-Zeilinger (GHZ) states. Further, we show how the generated
states can be used to specifically compute Boolean functions - which can be
used to test and verify the non-classicality of the underlying quantum states.
The connection between quantum correlation and computability shown here has
applications in quantum technologies, and is important for networked computing
being performed by measurements on distributed multipartite quantum states.
Related papers
- A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - Robustness of quantum correlation in quantum energy teleportation [0.0]
We present the evolution of quantum correlation in the quantum energy teleportation (QET) protocol using quantum discord.
In the QET protocol, where local observations and conditional operations are repeated, quantum correlations become nontrivial because of the statistical creation of mixed states.
arXiv Detail & Related papers (2024-02-01T10:35:09Z) - 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) - Quantum correlation generation capability of experimental processes [5.552315676636436]
EPR steering and Bell nonlocality illustrate two different kinds of correlations predicted by quantum mechanics.
We show that the capability of an experimental process to create quantum correlations can be quantified.
We demonstrate this utility by examining the experimental capability of creating quantum correlations with the controlled-phase operations on the IBM Quantum Experience and Amazon Braket Rigetti superconducting quantum computers.
arXiv Detail & Related papers (2023-04-30T02:22:56Z) - 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) - 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) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Scalable Simulation of Quantum Measurement Process with Quantum
Computers [13.14263204660076]
We propose qubit models to emulate the quantum measurement process.
One model is motivated by single-photon detection and the other by spin measurement.
We generate Schr"odinger cat-like state, and their corresponding quantum circuits are shown explicitly.
arXiv Detail & Related papers (2022-06-28T14:21:43Z) - 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) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z)
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.