Quantum machine learning with indefinite causal order

• URL: http://arxiv.org/abs/2403.03533v1
• Date: Wed, 6 Mar 2024 08:22:52 GMT
• Title: Quantum machine learning with indefinite causal order
• Authors: Nannan Ma, P. Z. Zhao, Jiangbin Gong
• Abstract summary: In a conventional circuit for quantum machine learning, the quantum gates used to encode the input parameters are constructed with a fixed order. We introduce indefinite causal order to quantum machine learning.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In a conventional circuit for quantum machine learning, the quantum gates used to encode the input parameters and the variational parameters are constructed with a fixed order. The resulting output function, which can be expressed in the form of a restricted Fourier series, has limited flexibility in the distributions of its Fourier coefficients. This indicates that a fixed order of quantum gates can limit the performance of quantum machine learning. Building on this key insight (also elaborated with examples), we introduce indefinite causal order to quantum machine learning. Because the indefinite causal order of quantum gates allows for the superposition of different orders, the performance of quantum machine learning can be significantly enhanced. Considering that the current accessible quantum platforms only allow to simulate a learning structure with a fixed order of quantum gates, we reform the existing simulation protocol to implement indefinite causal order and further demonstrate the positive impact of indefinite causal order on specific learning tasks. Our results offer useful insights into possible quantum effects in 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)
• Single-shot quantum machine learning [0.3277163122167433]
  We analyze when quantum learning models can produce predictions in a near-deterministic way. We show that the degree to which a quantum learning model is near-deterministic is constrained by the distinguishability of the embedded quantum states. We conclude by showing that quantum learning models cannot be single-shot in a generic way and trainable at the same time.
  arXiv  Detail & Related papers  (2024-06-19T20:17:18Z)
• 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)
• Universal Quantum Computation via Superposed Orders of Single-Qubit Gates [7.796917261490019]
  We prove that any two-qubit controlled quantum gate can be deterministically realized. Superposed orders of single-qubit gates can enable universal quantum computation.
  arXiv  Detail & Related papers  (2023-11-22T19:10:57Z)
• 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 process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Recent Advances for Quantum Neural Networks in Generative Learning [98.88205308106778]
  Quantum generative learning models (QGLMs) may surpass their classical counterparts. We review the current progress of QGLMs from the perspective of machine learning. We discuss the potential applications of QGLMs in both conventional machine learning tasks and quantum physics.
  arXiv  Detail & Related papers  (2022-06-07T07:32:57Z)
• Mitigating Quantum Errors via Truncated Neumann Series [10.04862322536857]
  We propose a unified framework that can mitigate quantum gate and measurement errors in computing quantum expectation values. The essential idea is to cancel the effect of quantum error by approximating its inverse via linearly combining quantum errors of different orders. We test this framework for different quantum errors and find that the computation accuracy is substantially improved.
  arXiv  Detail & Related papers  (2021-11-01T04:16:49Z)
• Quantum Data Compression and Quantum Cross Entropy [0.0]
  We show that quantum cross entropy acts as the compression rate for sub-optimal quantum source coding. This reveals that quantum cross entropy can effectively serve as a loss function in quantum machine learning algorithms.
  arXiv  Detail & Related papers  (2021-06-25T18:00:33Z)
• Trainable Discrete Feature Embeddings for Variational Quantum Classifier [4.40450723619303]
  We show how to map discrete features with fewer quantum bits using Quantum Random Access Coding (QRAC) We propose a new method to embed discrete features with trainable quantum circuits by combining QRAC and a recently proposed strategy for training quantum feature map called quantum metric learning.
  arXiv  Detail & Related papers  (2021-06-17T12:02:01Z)

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.