Expressing and Analyzing Quantum Algorithms with Qualtran

• URL: http://arxiv.org/abs/2409.04643v1
• Date: Fri, 6 Sep 2024 22:24:59 GMT
• Title: Expressing and Analyzing Quantum Algorithms with Qualtran
• Authors: Matthew P. Harrigan, Tanuj Khattar, Charles Yuan, Anurudh Peduri, Noureldin Yosri, Fionn D. Malone, Ryan Babbush, Nicholas C. Rubin,
• Abstract summary: We present Qualtran, an open-source library for representing and analyzing quantum algorithms. Qualtran offers a standard library of algorithmic building blocks that are essential for modern cost-minimizing compilations.
• Score: 0.06515015520518286
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computing's transition from theory to reality has spurred the need for novel software tools to manage the increasing complexity, sophistication, toil, and fallibility of quantum algorithm development. We present Qualtran, an open-source library for representing and analyzing quantum algorithms. Using appropriate abstractions and data structures, we can simulate and test algorithms, automatically generate information-rich diagrams, and tabulate resource requirements. Qualtran offers a standard library of algorithmic building blocks that are essential for modern cost-minimizing compilations. Its capabilities are showcased through the re-analysis of key algorithms in Hamiltonian simulation, chemistry, and cryptography. Architecture-independent resource counts output by Qualtran can be forwarded to our implementation of cost models to estimate physical costs like wall-clock time and number of physical qubits assuming a surface-code architecture. Qualtran provides a foundation for explicit constructions and reproducible analysis, fostering greater collaboration within the growing quantum algorithm development community.

Related papers

• Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction [0.9199465050084297]
  This work presents a novel unifying abstraction, called the position graph, for different types of hardware architectures. We model trapped-ion Quantum Charge-Coupled Device (QCCD) architectures and enable high-quality, superconducting scalable compilation methods. This approach generates native, executable circuits and ion instructions on the hardware that adheres to the physical constraints of shuttling-based quantum computers.
  arXiv  Detail & Related papers  (2025-01-21T19:39:03Z)
• SeQUeNCe GUI: An Extensible User Interface for Discrete Event Quantum Network Simulations [55.2480439325792]
  SeQUeNCe is an open source simulator of quantum network communication. We implement a graphical user interface which maintains the core principles of SeQUeNCe.
  arXiv  Detail & Related papers  (2025-01-15T19:36:09Z)
• 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 Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Distributed Simulation of Statevectors and Density Matrices [0.0]
  This manuscript presents a plethora of novel algorithms for distributed full-state simulation of gates, operators, noise channels and other calculations in digital quantum computers. We show how a simple, common but seemingly restrictive distribution model actually permits a rich set of advanced facilities. Our results are derived in language familiar to a quantum information theory audience, and our algorithms formalised for the scientific simulation community.
  arXiv  Detail & Related papers  (2023-11-02T18:00:36Z)
• 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)
• Quantum simulation with just-in-time compilation [0.0]
  We present a first attempt to perform circuit-based quantum simulation using the just-in-time (JIT) compilation technique. Qibojit is a new module for the Qibo quantum computing framework, which uses a just-in-time compilation approach through Python.
  arXiv  Detail & Related papers  (2022-03-16T18:00:00Z)
• MQBench: Towards Reproducible and Deployable Model Quantization Benchmark [53.12623958951738]
  MQBench is a first attempt to evaluate, analyze, and benchmark the and deployability for model quantization algorithms. We choose multiple platforms for real-world deployments, including CPU, GPU, ASIC, DSP, and evaluate extensive state-of-the-art quantization algorithms. We conduct a comprehensive analysis and find considerable intuitive or counter-intuitive insights.
  arXiv  Detail & Related papers  (2021-11-05T23:38:44Z)
• QForte: an efficient state simulator and quantum algorithms library for molecular electronic structure [0.0]
  We introduce a novel open-source software package QForte, a comprehensive development tool for new quantum simulation algorithms. QForte incorporates functionality for handling molecular Hamiltonians, fermionic encoding, ansatz construction, time evolution, and state-vector simulation.
  arXiv  Detail & Related papers  (2021-08-10T02:51:42Z)
• QuaSiMo: A Composable Library to Program Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-05-17T16:17:57Z)
• Tequila: A platform for rapid development of quantum algorithms [0.3248699949578586]
  Tequila is a development package for quantum algorithms in python. It is designed for fast and flexible implementation, prototyping, and deployment of novel quantum algorithms in electronic structure and other fields.
  arXiv  Detail & Related papers  (2020-11-05T19:00:58Z)

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.