Representation of Classical Data on Quantum Computers

• URL: http://arxiv.org/abs/2410.00742v2
• Date: Tue, 26 Nov 2024 15:21:01 GMT
• Title: Representation of Classical Data on Quantum Computers
• Authors: Thomas Lang, Anja Heim, Kilian Dremel, Dimitri Prjamkov, Martin Blaimer, Markus Firsching, Anastasia Papadaki, Stefan Kasperl, Theobald OJ Fuchs,
• Abstract summary: It is imperative to represent the data used onto a quantum computing system. This report aims to provide an overview of existing methods for representing these data types on gate-based quantum computers.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computing is currently gaining significant attention, not only from the academic community but also from industry, due to its potential applications across several fields for addressing complex problems. For any practical problem which may be tackled using quantum computing, it is imperative to represent the data used onto a quantum computing system. Depending on the application, many different types of data and data structures occur, including regular numbers, higher-dimensional data structures, e.g., n-dimensional images, up to graphs. This report aims to provide an overview of existing methods for representing these data types on gate-based quantum computers.

Related papers

• Towards structure-preserving quantum encodings [0.2118773996967412]
  Quantum computers can harness the potential computational advantage of quantum computers for machine learning tasks. The choice of such encodings may vary substantially from one task to another, and there exist only a few cases where structure has provided insight into their design and implementation. Here, we propose the perspective that category theory offers a natural mathematical framework for analyzing encodings that respect structure inherent in datasets and learning tasks.
  arXiv  Detail & Related papers  (2024-12-23T18:32:08Z)
• 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)
• 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)
• Ion-Based Quantum Computing Hardware: Performance and End-User Perspective [0.3348742525511937]
  This is the second paper in a series of papers providing an overview of different quantum computing hardware platforms. It follows our first paper on neutral-atom quantum computing.
  arXiv  Detail & Related papers  (2024-05-19T05:04:07Z)
• Streaming IoT Data and the Quantum Edge: A Classic/Quantum Machine Learning Use Case [0.6554326244334868]
  We investigate the use of Edge computing for the integration of quantum machine learning into a distributed computing continuum. We present preliminary results for quantum machine learning analytics on an IoT scenario.
  arXiv  Detail & Related papers  (2024-02-23T10:36:22Z)
• Guided Quantum Compression for High Dimensional Data Classification [0.0]
  Quantum machine learning provides a fundamentally different approach to analyzing data. Here, we design a classical-quantum paradigm that unifies the dimensionality reduction task with a quantum classification model. We exemplify how this architecture outperforms conventional quantum machine learning approaches on a challenging binary classification problem.
  arXiv  Detail & Related papers  (2024-02-14T19:01:51Z)
• Realization of quantum algorithms with qudits [0.7892577704654171]
  We review several ideas indicating how multilevel quantum systems, also known as qudits, can be used for efficient realization of quantum algorithms. We focus on techniques of leveraging qudits for simplifying decomposition of multiqubit gates, and for compressing quantum information by encoding multiple qubits in a single qudit. These theoretical schemes can be implemented with quantum computing platforms of various nature, such as trapped ions, neutral atoms, superconducting junctions, and quantum light.
  arXiv  Detail & Related papers  (2023-11-20T18:34:19Z)
• 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)
• Machine learning applications for noisy intermediate-scale quantum computers [0.0]
  We develop and study three quantum machine learning applications suitable for NISQ computers. These algorithms are variational in nature and use parameterised quantum circuits (PQCs) as the underlying quantum machine learning model. We propose a variational algorithm in the area of approximate quantum cloning, where the data becomes quantum in nature.
  arXiv  Detail & Related papers  (2022-05-19T09:26:57Z)
• Scalable approach to many-body localization via quantum data [69.3939291118954]
  Many-body localization is a notoriously difficult phenomenon from quantum many-body physics. We propose a flexible neural network based learning approach that circumvents any computationally expensive step. Our approach can be applied to large-scale quantum experiments to provide new insights into quantum many-body physics.
  arXiv  Detail & Related papers  (2022-02-17T19:00:09Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Large-scale quantum machine learning [0.0]
  We measure quantum kernels using randomized measurements to gain a quadratic speedup in time and quickly process large datasets. We efficiently encode high-dimensional data into quantum computers with the number of features scaling linearly with the circuit depth. Using currently available quantum computers, the MNIST database can be processed within 220 hours instead of 10 years.
  arXiv  Detail & Related papers  (2021-08-02T17:00:18Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.