Highly optimized quantum circuits synthesized via data-flow engines
arXiv:2211.07685 · doi:10.1016/j.jcp.2024.112756
Abstract
The formulation of quantum programs in terms of the fewest number of gate operations is crucial to retrieve meaningful results from the noisy quantum processors accessible these days. In this work, we demonstrate a use-case for Field Programmable Gate Array (FPGA) based data-flow engines (DFEs) to scale up variational quantum compilers to synthesize circuits up to -qubit programs.This gate decomposer utilizes a newly developed DFE quantum computer simulator that is designed to simulate arbitrary quantum circuit consisting of single qubit rotations and controlled two-qubit gates on FPGA chips. In our benchmark with the QISKIT package, the depth of the circuits produced by the SQUANDER package (with the DFE accelerator support) were less by on average, while the fidelity of the circuits was still close to unity up to an error of .
arXiv comment28 pages, 3 figures, 1 table
References in corpus (21)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A variational eigenvalue solver on a quantum processor
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- Quantum algorithm for solving linear systems of equations
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- Hartree-Fock on a superconducting qubit quantum computer
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Experimental Comparison of Two Quantum Computing Architectures
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Quantum-assisted quantum compiling
- Solving nonlinear differential equations with differentiable quantum circuits
- Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing
- Variational algorithms for linear algebra
- Measuring the Capabilities of Quantum Computers
- Timing and resource-aware mapping of quantum circuits to superconducting processors
- Approaching the theoretical limit in quantum gate decomposition
- LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
- Variational Quantum Evolution Equation Solver
- Performance of Superconducting Quantum Computing Chips under Different Architecture Design