Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams
- URL: http://arxiv.org/abs/2406.03531v1
- Date: Wed, 5 Jun 2024 18:00:01 GMT
- Title: Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams
- Authors: Kevin Mato, Stefan Hillmich, Robert Wille,
- Abstract summary: Quantum computers have the potential to solve intractable problems.
One key element to exploiting this potential is the capability to efficiently prepare quantum states for multi-valued, or qudit, systems.
In this paper, we investigate quantum state preparation with a focus on mixed-dimensional systems.
- Score: 3.393749500700096
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in performance over the prevailing two-level logic. One key element to exploiting this potential is the capability to efficiently prepare quantum states for multi-valued, or qudit, systems. Due to the time sensitivity of quantum computers, the circuits to prepare the required states have to be as short as possible. In this paper, we investigate quantum state preparation with a focus on mixed-dimensional systems, where the individual qudits may have different dimensionalities. The proposed approach automatically realizes quantum circuits constructing a corresponding mixed-dimensional quantum state. To this end, decision diagrams are used as a compact representation of the quantum state to be realized. We further incorporate the ability to approximate the quantum state to enable a finely controlled trade-off between accuracy, memory complexity, and number of operations in the circuit. Empirical evaluations demonstrate the effectiveness of the proposed approach in facilitating fast and scalable quantum state preparation, with performance directly linked to the size of the decision diagram. The implementation is freely available as part of Munich Quantum Toolkit~(MQT), under the framework MQT Qudits at github.com/cda-tum/mqt-qudits.
Related papers
- 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) - ADAPT-QSCI: Adaptive Construction of Input State for Quantum-Selected
Configuration Interaction [0.0]
We present a quantum-classical hybrid algorithm for calculating the ground state and its energy of the quantum many-body Hamiltonian.
We numerically illustrate that our method, dubbed textitADAPT-QSCI, can yield accurate ground-state energies for small molecules.
arXiv Detail & Related papers (2023-11-02T09:15:50Z) - Scalable Quantum Ground State Preparation of the Heisenberg Model: A
Variational Quantum Eigensolver Approach [0.0]
Variational Quantumsolver (VQE) algorithm is a system composed of a quantum circuit and a classical Eigenational Quantumsolver.
We present an ansatz capable of preparing the ground states for all possible values of the coupling, including the critical states for the anisotropic XXZ model.
arXiv Detail & Related papers (2023-08-23T09:26:34Z) - 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) - Potential and limitations of quantum extreme learning machines [55.41644538483948]
We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements.
Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
arXiv Detail & Related papers (2022-10-03T09:32:28Z) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Quantum Computing Quantum Monte Carlo [8.69884453265578]
We propose a hybrid quantum-classical algorithm that integrates quantum computing and quantum Monte Carlo.
Our work paves the way to solving practical problems with intermediatescale and early-fault tolerant quantum computers.
arXiv Detail & Related papers (2022-06-21T14:26:24Z) - 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) - On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
We devise three effective QAE-based learning protocols to address three classically computational hard learning problems.
Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - Verification of Distributed Quantum Programs [6.266176871677275]
We propose a CSP-like distributed programming language to facilitate the specification and verification of distributed quantum systems.
The effectiveness of the logic is demonstrated by its applications in the verification of quantum teleportation and local implementation of non-local CNOT gates.
arXiv Detail & Related papers (2021-04-30T07:23:55Z)
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.