Operator and Graph Theoretic Techniques for Distinguishing Quantum States via One-Way LOCC

• URL: http://arxiv.org/abs/2110.07657v1
• Date: Thu, 14 Oct 2021 18:26:40 GMT
• Title: Operator and Graph Theoretic Techniques for Distinguishing Quantum States via One-Way LOCC
• Authors: Comfort Mintah, David W. Kribs, Michael Nathanson, Rajesh Pereira
• Abstract summary: We bring together some of the main results and applications from our recent works in quantum information theory. We investigate the topic of distinguishability of sets of quantum states in quantum communication. We derive a new graph-theoretic description of distinguishability in the case of a single qubit sender.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We bring together in one place some of the main results and applications from our recent works in quantum information theory, in which we have brought techniques from operator theory, operator algebras, and graph theory for the first time to investigate the topic of distinguishability of sets of quantum states in quantum communication, with particular reference to the framework of one-way local quantum operations and classical communication (LOCC). We also derive a new graph-theoretic description of distinguishability in the case of a single qubit sender.

Related papers

• Entanglement structure in quantum many-body systems, field theories, and holography [0.0]
  The aim of this dissertation is to clarify the structure of entanglement, a type of quantum correlations, in various quantum systems. Previous examinations of entanglement and holography have focused on specific classes of quantum systems.
  arXiv  Detail & Related papers  (2023-08-18T18:04:44Z)
• 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)
• Chordal Graphs and Distinguishability of Quantum Product States [0.0]
  We identify chordality as the key graph structure that drives distinguishability in one-way LOCC. We derive a one-way LOCC characterization for chordal graphs that establishes a connection with the theory of matrix completions.
  arXiv  Detail & Related papers  (2023-05-17T12:17:47Z)
• 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)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Why and how to add direction to a quantum walk [0.0]
  We formalize the treatment of directed (or chiral) quantum walks using Hermitian adjacency matrices. This leads to a construction of a new type of quantum phenomenon: zero transfer between pairs of sites in a connected coupled network.
  arXiv  Detail & Related papers  (2022-03-25T18:51:23Z)
• One-shot quantum state redistribution and quantum Markov chains [15.66921140731163]
  We revisit the task of quantum state redistribution in the one-shot setting. We design a protocol for this task with communication cost in terms of a measure of distance from quantum Markov chains. Our result is the first to operationally connect quantum state redistribution and quantum chains.
  arXiv  Detail & Related papers  (2021-04-18T07:34:22Z)
• 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)
• Principles of Quantum Communication Theory: A Modern Approach [5.529670766249317]
  This is a preliminary version of a book in progress on the theory of quantum communication. We adopt an information-theoretic perspective throughout and give a comprehensive account of fundamental results in quantum communication theory.
  arXiv  Detail & Related papers  (2020-11-09T19:00:06Z)
• From a quantum theory to a classical one [117.44028458220427]
  We present and discuss a formal approach for describing the quantum to classical crossover. The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
  arXiv  Detail & Related papers  (2020-04-01T09:16:38Z)

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.