Data is often loadable in short depth: Quantum circuits from tensor networks for finance, images, fluids, and proteins

• URL: http://arxiv.org/abs/2309.13108v3
• Date: Wed, 27 Dec 2023 02:04:11 GMT
• Title: Data is often loadable in short depth: Quantum circuits from tensor networks for finance, images, fluids, and proteins
• Authors: Raghav Jumade, Nicolas PD Sawaya
• Abstract summary: We introduce a circuit compilation method based on tensor network (TN) theory. We perform numerical experiments on real-world classical data from four distinct areas. This is the broadest numerical analysis to date of loading classical data into a quantum computer.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Though there has been substantial progress in developing quantum algorithms to study classical datasets, the cost of simply \textit{loading} classical data is an obstacle to quantum advantage. When the amplitude encoding is used, loading an arbitrary classical vector requires up to exponential circuit depths with respect to the number of qubits. Here, we address this ``input problem'' with two contributions. First, we introduce a circuit compilation method based on tensor network (TN) theory. Our method -- AMLET (Automatic Multi-layer Loader Exploiting TNs) -- proceeds via careful construction of a specific TN topology and can be tailored to arbitrary circuit depths. Second, we perform numerical experiments on real-world classical data from four distinct areas: finance, images, fluid mechanics, and proteins. To the best of our knowledge, this is the broadest numerical analysis to date of loading classical data into a quantum computer. The required circuit depths are often several orders of magnitude lower than the exponentially-scaling general loading algorithm would require. Besides introducing a more efficient loading algorithm, this work demonstrates that many classical datasets are loadable in depths that are much shorter than previously expected, which has positive implications for speeding up classical workloads on quantum computers.

Related papers

• Toward speedup without quantum coherent access [0.0]
  We propose a variant of quantum algorithms, leveraging both classical and quantum resources.<n>We show how to use it to tackle a wide range of problems, including principal component analysis, linear equation solving, Hamiltonian simulation, and data fitting.
  arXiv  Detail & Related papers  (2026-02-24T11:21:44Z)
• Structured Unitary Tensor Network Representations for Circuit-Efficient Quantum Data Encoding [33.951713386684425]
  TNQE is a circuit-efficient quantum data encoding framework built on structured unitary tensor network representations.<n> TNQE compiles the resulting tensor cores into an encoding circuit through two complementary core-to-circuit strategies.<n>Across a range of benchmarks, TNQE achieves encoding circuits as shallow as $0.04times$ the depth of amplitude encoding.
  arXiv  Detail & Related papers  (2026-02-18T08:36:07Z)
• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Typical Machine Learning Datasets as Low-Depth Quantum Circuits [0.40329768057075643]
  We develop an efficient algorithm for finding low-depth quantum circuits to load classical image data as quantum states.<n>We conduct systematic studies on the MNIST, Fashion-MNIST, CIFAR-10, and Imagenette datasets.
  arXiv  Detail & Related papers  (2025-05-06T10:27:51Z)
• Quantum Image Loading: Hierarchical Learning and Block-Amplitude Encoding [0.5889536104474146]
  We extend the hierarchical learning framework to encode images into quantum states. We successfully load digits from the MNIST dataset as well as road scenes from the Honda Scenes dataset. We deploy our learned circuits on both IBM and Quantinuum hardware and find that these loading circuits are sufficiently shallow to fit within existing noise rates.
  arXiv  Detail & Related papers  (2025-04-14T18:00:10Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings. We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Quantum Sinusoidal Neural Networks [0.6021787236982659]
  We design a quantum version of neural networks with sinusoidal activation functions.<n>We compare its performance to the classical case.<n>We build a quantum optimization algorithm around the quantum sine circuit.
  arXiv  Detail & Related papers  (2024-10-29T13:06:46Z)
• 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)
• Q-gen: A Parameterized Quantum Circuit Generator [0.6062751776009752]
  We introduce Q-gen, a high-level, parameterized quantum circuit generator incorporating 15 realistic quantum algorithms. Q-gen is an open-source project that serves as the entrance for users with a classical computer science background to dive into the world of quantum computing.
  arXiv  Detail & Related papers  (2024-07-26T12:22:40Z)
• Supervised binary classification of small-scale digit images and weighted graphs with a trapped-ion quantum processor [56.089799129458875]
  We present the results of benchmarking a quantum processor based on trapped $171$Yb$+$ ions.<n>We perform a supervised binary classification on two types of datasets: small binary digit images and weighted graphs with a ring topology.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• Tensor Quantum Programming [0.0]
  We develop an algorithm that encodes Matrix Product Operators into quantum circuits with a depth that depends linearly on the number of qubits. It demonstrates effectiveness on up to 50 qubits for several frequently encountered in differential equations, optimization problems, and quantum chemistry.
  arXiv  Detail & Related papers  (2024-03-20T10:44:00Z)
• 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)
• Efficient MPS representations and quantum circuits from the Fourier modes of classical image data [0.0]
  We show that classical data with a quickly decaying Fourier spectrum can be well-approximated by states with a small Schmidt rank. These approximated states can, in turn, be prepared on a quantum computer with a linear number of nearest-neighbor two-qubit gates. We also consider different variational circuit ans"atze and demonstrate numerically that one-dimensional sequential circuits achieve the same compression quality as more powerful ans"atze.
  arXiv  Detail & Related papers  (2023-11-13T19:00:33Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Hunting for quantum-classical crossover in condensed matter problems [0.3799859284309834]
  We propose a systematic error/runtime analysis on state-of-the-art classical algorithm based on tensor networks. We argue that condensed matter problems offer the earliest platform for demonstration of practical quantum advantage.
  arXiv  Detail & Related papers  (2022-10-25T15:50:54Z)
• Accelerating the training of single-layer binary neural networks using the HHL quantum algorithm [58.720142291102135]
  We show that useful information can be extracted from the quantum-mechanical implementation of Harrow-Hassidim-Lloyd (HHL) This paper shows, however, that useful information can be extracted from the quantum-mechanical implementation of HHL, and used to reduce the complexity of finding the solution on the classical side.
  arXiv  Detail & Related papers  (2022-10-23T11:58:05Z)
• Quantum neural networks [0.0]
  This thesis combines two of the most exciting research areas of the last decades: quantum computing and machine learning. We introduce dissipative quantum neural networks (DQNNs), which are capable of universal quantum computation and have low memory requirements while training.
  arXiv  Detail & Related papers  (2022-05-17T07:47:00Z)
• 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)
• Quantum Computing without Quantum Computers: Database Search and Data Processing Using Classical Wave Superposition [101.18253437732933]
  We present experimental data on magnetic database search using spin wave superposition. We argue that in some cases the classical wave-based approach may provide the same speedup in database search as quantum computers.
  arXiv  Detail & Related papers  (2020-12-15T16:21: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.