Quantum Circuit $C^*$-algebra Net

• URL: http://arxiv.org/abs/2404.06218v1
• Date: Tue, 9 Apr 2024 11:12:39 GMT
• Title: Quantum Circuit $C^*$-algebra Net
• Authors: Yuka Hashimoto, Ryuichiro Hataya,
• Abstract summary: This paper introduces quantum circuit $C*$-algebra net, which provides a connection between $C*$-algebra nets proposed in machine learning and quantum circuits. As an application, we propose to use the quantum circuit $C*$-algebra net to encode classical data into quantum states, which enables us to integrate classical data into quantum algorithms.
• Score: 5.359060261460183
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper introduces quantum circuit $C^*$-algebra net, which provides a connection between $C^*$-algebra nets proposed in classical machine learning and quantum circuits. Using $C^*$-algebra, a generalization of the space of complex numbers, we can represent quantum gates as weight parameters of a neural network. By introducing additional parameters, we can induce interaction among multiple circuits constructed by quantum gates. This interaction enables the circuits to share information among them, which contributes to improved generalization performance in machine learning tasks. As an application, we propose to use the quantum circuit $C^*$-algebra net to encode classical data into quantum states, which enables us to integrate classical data into quantum algorithms. Numerical results demonstrate that the interaction among circuits improves performance significantly in image classification, and encoded data by the quantum circuit $C^*$-algebra net are useful for downstream quantum machine learning tasks.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Quantum Circuit Learning on NISQ Hardware [0.0]
  Current quantum computers are small and error-prone systems. Fault-tolerant quantum computers are not expected to be available in the near future. We show that exemplary QCL circuits with up to three qubits are executable on the IBM quantum computer.
  arXiv  Detail & Related papers  (2024-05-03T13:00:32Z)
• Learning shallow quantum circuits [7.411898489476803]
  We present an algorithm for learning the description of any unknown $n$-qubit shallow quantum circuit $U$. We also provide a classical algorithm for learning the description of any unknown $n$-qubit state $lvert psi rangle$. Our approach uses a quantum circuit representation based on local inversions and a technique to combine these inversions.
  arXiv  Detail & Related papers  (2024-01-18T16:05:00Z)
• Analysis of arbitrary superconducting quantum circuits accompanied by a Python package: SQcircuit [0.0]
  Superconducting quantum circuits are a promising hardware platform for realizing a fault-tolerant quantum computer. We develop a framework to construct a superconducting quantum circuit's quantized Hamiltonian from its physical description. We implement the methods described in this work in an open-source Python package SQcircuit.
  arXiv  Detail & Related papers  (2022-06-16T17:24:51Z)
• 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)
• A quantum algorithm for training wide and deep classical neural networks [72.2614468437919]
  We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems. We numerically demonstrate that the MNIST image dataset satisfies such conditions. We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
  arXiv  Detail & Related papers  (2021-07-19T23:41:03Z)
• Sample Complexity of Learning Quantum Circuits [4.329298109272386]
  We prove that physical quantum circuits are PAC learnable on a quantum computer via empirical risk minimization. Our results provide a valuable guide for quantum machine learning in both theory and experiment.
  arXiv  Detail & Related papers  (2021-07-19T18:00:04Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• On connectivity-dependent resource requirements for digital quantum simulation of $d$-level particles [0.703901004178046]
  We study the number of SWAP gates required to Trotterize commonly used quantum operators. Results are applicable in hardware co-design and in choosing efficient qudit encodings for a given set of near-term quantum hardware.
  arXiv  Detail & Related papers  (2020-05-26T22:28:51Z)
• Machine learning transfer efficiencies for noisy quantum walks [62.997667081978825]
  We show that the process of finding requirements on both a graph type and a quantum system coherence can be automated. The automation is done by using a convolutional neural network of a particular type that learns to understand with which network and under which coherence requirements quantum advantage is possible. Our results are of importance for demonstration of advantage in quantum experiments and pave the way towards automating scientific research and discoveries.
  arXiv  Detail & Related papers  (2020-01-15T18:36:53Z)

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.