Mixed-Dimensional Quantum Circuit Simulation with Decision Diagrams

• URL: http://arxiv.org/abs/2308.12332v1
• Date: Wed, 23 Aug 2023 18:00:01 GMT
• Title: Mixed-Dimensional Quantum Circuit Simulation with Decision Diagrams
• Authors: Kevin Mato and Stefan Hillmich and Robert Wille
• Abstract summary: We present a qudit simulator that handles mixed-dimensional systems based on Decision Diagrams (DDs) The simulator is capable of efficiently simulating mixed-dimensional circuits, with specific use cases including more than 100 qudits in one circuit.
• Score: 3.814234334620511
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers promise to solve several categories of problems faster than classical computers ever could. Current research mostly focuses on qubits, i.e., systems where the unit of information can assume only two levels. However, the underlying physics of most (if not all) of the technological platforms supports more than two levels, commonly referred to as qudits. Performing computations with qudits increases the overall complexity while, at the same time, reducing the number of operations and providing a lower error rate. Furthermore, qudits with different number of levels can be mixed in one system to ease the experimental control and keep representations as compact as possible. Exploiting these capabilities requires dedicated software support to tackle the increased complexity in an automated and efficient fashion. In this paper, we present a qudit simulator that handles mixed-dimensional systems based on Decision Diagrams (DDs). More precisely, we discuss the type of decision diagram introduced as underlying data structure as well as the resulting implementation. Experimental evaluations demonstrate that the proposed solution is capable of efficiently simulating mixed-dimensional quantum circuits, with specific use cases including more than 100 qudits in one circuit. The source code of the simulator is available via github.com/cda-tum/MiSiM under the MIT~license.

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 algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• A Classical Architecture For Digital Quantum Computers [21.99729700579818]
  Scaling bottlenecks the making of digital quantum computers poses challenges from both the quantum computation and the classical components. We present a classical architecture to cope with a comprehensive list of the latter challenges em all at once, and implement it fully in an end-to-end system. Our architecture enables scalable, high-precision control of large quantum processors and accommodates evolving requirements of quantum hardware.
  arXiv  Detail & Related papers  (2023-05-23T17:44:06Z)
• Variational Quantum Eigensolver for Classification in Credit Sales Risk [0.5524804393257919]
  We take into consideration a quantum circuit which is based on the Variational Quantum Eigensolver (VQE) and so-called SWAP-Test. In the utilized data set, two classes may be observed -- cases with low and high credit risk. The solution is compact and requires only logarithmically increasing number of qubits.
  arXiv  Detail & Related papers  (2023-03-05T23:08:39Z)
• 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)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• 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)
• Quantum Sparse Coding [5.130440339897477]
  We develop a quantum-inspired algorithm for sparse coding. The emergence of quantum computers and Ising machines can potentially lead to more accurate estimations. We conduct numerical experiments with simulated data on Lightr's quantum-inspired digital platform.
  arXiv  Detail & Related papers  (2022-09-08T13:00:30Z)
• Efficient realization of quantum algorithms with qudits [0.70224924046445]
  We propose a technique for an efficient implementation of quantum algorithms with multilevel quantum systems (qudits) Our method uses a transpilation of a circuit in the standard qubit form, which depends on the parameters of a qudit-based processor. We provide an explicit scheme of transpiling qubit circuits into sequences of single-qudit and two-qudit gates taken from a particular universal set.
  arXiv  Detail & Related papers  (2021-11-08T11:09:37Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Improved Quantum State Tomography for the Systems with XX+YY Couplings and Z Readouts [0.20305676256390928]
  I propose an improved quantum state tomography (QST) using 2-qubit evolutions as the readout operations. I respectively apply the new scheme on SQC systems with the Nearest-Neighbor, 2-Dimensional, and All-to-All connectivities on qubits. It is found that, the new scheme has good implementability and it can achieve comparable or even better accuracy than the traditional scheme.
  arXiv  Detail & Related papers  (2020-06-29T08:48: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.