Efficient algorithms for quantum information bottleneck

• URL: http://arxiv.org/abs/2208.10342v1
• Date: Mon, 22 Aug 2022 14:20:05 GMT
• Title: Efficient algorithms for quantum information bottleneck
• Authors: Masahito Hayashi and Yuxiang Yang
• Abstract summary: We propose a new and general algorithm for the quantum generalisation of information bottleneck. Our algorithm excels in the speed and the definiteness of convergence compared with prior results. Notably, we discover that a quantum system can achieve strictly better performance than a classical system of the same size regarding quantum information bottleneck.
• Score: 64.67104066707309
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The ability to extract relevant information is critical to learning. An ingenious approach as such is the information bottleneck, an optimisation problem whose solution corresponds to a faithful and memory-efficient representation of relevant information from a large system. The advent of the age of quantum computing calls for efficient methods that work on information regarding quantum systems. Here we address this by proposing a new and general algorithm for the quantum generalisation of information bottleneck. Our algorithm excels in the speed and the definiteness of convergence compared with prior results. It also works for a much broader range of problems, including the quantum extension of deterministic information bottleneck, an important variant of the original information bottleneck problem. Notably, we discover that a quantum system can achieve strictly better performance than a classical system of the same size regarding quantum information bottleneck, providing new vision on justifying the advantage of quantum machine learning.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• Quantum Visual Feature Encoding Revisited [8.839645003062456]
  This paper revisits the quantum visual encoding strategies, the initial step in quantum machine learning. Investigating the root cause, we uncover that the existing quantum encoding design fails to ensure information preservation of the visual features after the encoding process. We introduce a new loss function named Quantum Information Preserving to minimize this gap, resulting in enhanced performance of quantum machine learning algorithms.
  arXiv  Detail & Related papers  (2024-05-30T06:15:08Z)
• A Quantum Algorithm Based Heuristic to Hide Sensitive Itemsets [1.8419202109872088]
  We present a quantum approach to solve a well-studied problem in the context of data sharing. We present results on experiments involving small datasets to illustrate how the problem could be solved using quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-12T20:44:46Z)
• Neural auto-designer for enhanced quantum kernels [59.616404192966016]
  We present a data-driven approach that automates the design of problem-specific quantum feature maps. Our work highlights the substantial role of deep learning in advancing quantum machine learning.
  arXiv  Detail & Related papers  (2024-01-20T03:11:59Z)
• Efficient information recovery from Pauli noise via classical shadow [6.689075863602204]
  We introduce an efficient algorithm that can recover information from quantum states under Pauli noise. For a local and bounded-degree observable, only partial knowledge of the channel is required to recover the ideal information. As a notable application, our method can be severed as a sample-efficient error mitigation scheme for Clifford circuits.
  arXiv  Detail & Related papers  (2023-05-06T23:34:13Z)
• Information scrambling and entanglement in quantum approximate optimization algorithm circuits [9.730534141168752]
  Variational quantum algorithms are promising for demonstrating quantum advantages in the noisy intermediate-scale quantum (NISQ) era. We study information scrambling and entanglement in QAOA circuits, respectively, and discover that for a harder problem, more quantum resource is required.
  arXiv  Detail & Related papers  (2023-01-18T11:36:49Z)
• Tracing Information Flow from Open Quantum Systems [52.77024349608834]
  We use photons in a waveguide array to implement a quantum simulation of the coupling of a qubit with a low-dimensional discrete environment. Using the trace distance between quantum states as a measure of information, we analyze different types of information transfer.
  arXiv  Detail & Related papers  (2021-03-22T16:38:31Z)
• Hybrid Quantum Computing -- Tabu Search Algorithm for Partitioning Problems: preliminary study on the Traveling Salesman Problem [0.8434687648198277]
  We introduce a novel solving scheme coined as hybrid Quantum Computing - Tabu Search Algorithm. Main pillars of operation of the proposed method are a greater control over the access to quantum resources, and a considerable reduction of non-profitable accesses.
  arXiv  Detail & Related papers  (2020-12-09T11:21:50Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.