Stripping Quantum Decision Diagrams of their Identity
- URL: http://arxiv.org/abs/2406.11959v1
- Date: Mon, 17 Jun 2024 18:00:01 GMT
- Title: Stripping Quantum Decision Diagrams of their Identity
- Authors: Aaron Sander, Ioan-Albert Florea, Lukas Burgholzer, Robert Wille,
- Abstract summary: We make an important step forward for quantum DDs by stripping these identity structures from quantum operations.
We obtain a structure that is more natural for quantum computing and significantly speeds up with computations-with a runtime improvement of up to 70x compared to the state-of-the-art.
- Score: 4.014151979580607
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Classical representations of quantum states and operations as vectors and matrices are plagued by an exponential growth in memory and runtime requirements for increasing system sizes. Based on their use in classical computing, an alternative data structure known as Decision Diagrams (DDs) has been proposed, which, in many cases, provides both a more compact representation and more efficient computation. In the classical realm, decades of research have been conducted on DDs and numerous variations tailored for specific applications exist. However, DDs for quantum computing are just in their infancy and there is still room for tailoring them to this new technology. In particular, existing representations of DDs require extending all operations in a quantum circuit to the full system size through extension by nodes representing identity matrices. In this work, we make an important step forward for quantum DDs by stripping these identity structures from quantum operations. This significantly reduces the number of nodes required to represent them as well as eases the pressure on key building blocks of their implementation. As a result, we obtain a structure that is more natural for quantum computing and significantly speeds up with computations-with a runtime improvement of up to 70x compared to the state-of-the-art.
Related papers
- Q-Sylvan: A Parallel Decision Diagram Package for Quantum Computing [0.0]
We present an efficient implementation of parallel edge-valued DDs.<n>We use these DDs to implement two use cases: simulation and equivalence checking of quantum circuits.<n>Our tool, Q-Sylvan, shows a single-core performance that is competitive with the state-of-the-art quantum DD tool MQT DDSIM on large instances.
arXiv Detail & Related papers (2025-08-01T10:48:52Z) - 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) - Expressive Limits of Quantum Reservoir Computing [0.0]
We show that the expressive power of a quantum reservoir computer is limited by the way the input is injected.
We find that, contrary to the intuitive expectation, increasing the complexity of the reservoir does not necessarily increase its expressivity.
arXiv Detail & Related papers (2025-01-26T13:43:03Z) - Mera: Memory Reduction and Acceleration for Quantum Circuit Simulation via Redundancy Exploration [4.271968023823568]
We propose a multi-level optimization, namely Mera, to reduce memory usage and accelerate simulation.
For a large number of sparse quantum gates, we propose two compressed structures for low-level full-state simulation.
Experiments show that our compressed structures increase the number of qubits from 17 to 35, and achieve up to 6.9 times acceleration for QNN.
arXiv Detail & Related papers (2024-11-22T20:07:31Z) - Quantum DeepONet: Neural operators accelerated by quantum computing [1.4918461320598675]
We propose to utilize quantum computing to accelerate DeepONet evaluations.
We benchmark our quantum DeepONet using a variety of PDEs, including the antiderivative operator, advection equation, and Burgers' equation.
arXiv Detail & Related papers (2024-09-24T02:53:42Z) - 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) - Towards Fault-Tolerant Quantum Deep Learning: Designing and Analyzing Quantum ResNet and Transformer with Quantum Arithmetic and Linear Algebra Primitives [5.89456905230997]
We introduce a framework to overcome the dual challenges of constructing deep architectures and the prohibitive overhead of data loading and measurement.<n>Our framework enables the design of multi-layer Quantum ResNet and Quantum Transformer models.<n>A cornerstone of our approach is a novel data transfer protocol, Discrete Chebyshev Decomposition (DCD), which facilitates this modularity.
arXiv Detail & Related papers (2024-02-29T08:12:02Z) - 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) - Attribute Fusion-based Evidential Classifier on Quantum Circuits [22.096543893284995]
Dempster-Shafer Theory (DST) as an effective and robust framework for handling uncertain information is applied in decision-making and pattern classification.
People attempt to address the issue by taking advantage of its consistency with quantum computing to implement DST operations on quantum circuits and realize speedup.
In this paper, we find that Boolean algebra as an essential mathematical tool bridges the definition of DST and quantum computing.
arXiv Detail & Related papers (2024-01-02T15:01:20Z) - Control and Readout of a 13-level Trapped Ion Qudit [0.0]
We show control and single-shot readout of qudits with up to 13 computational states.
This represents more than twice as many computational states per qudit compared with prior work in trapped ions.
We anticipate efficiently utilizing available energy states in a trapped ion to play a significant and complementary role in scaling up the computational space of a trapped ion quantum computer.
arXiv Detail & Related papers (2023-06-06T01:23:41Z) - The Basis of Design Tools for Quantum Computing: Arrays, Decision
Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
Quantum computers promise to efficiently solve important problems classical computers never will.
A fully automated quantum software stack needs to be developed.
This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
arXiv Detail & Related papers (2023-01-10T19:00:00Z) - Iterative Qubits Management for Quantum Index Searching in a Hybrid
System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system.
We implement IQuCS with Qiskit and conduct intensive experiments.
Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - 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)
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.