Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource
Estimation
- URL: http://arxiv.org/abs/2003.08408v2
- Date: Tue, 5 Jan 2021 11:49:52 GMT
- Title: Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource
Estimation
- Authors: Giulia Meuli, Mathias Soeken, Martin Roetteler and Thomas H\"aner
- Abstract summary: Approximation errors must be taken into account when compiling quantum programs into a low-level gate set.
We present a methodology that tracks such errors automatically and then optimize accuracy parameters to guarantee a specified overall accuracy.
We develop two prototype implementations, one in C++ based on Clang/LLVM, and another using the Q# compiler infrastructure.
- Score: 3.961270923919885
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Approximation errors must be taken into account when compiling quantum
programs into a low-level gate set. We present a methodology that tracks such
errors automatically and then optimizes accuracy parameters to guarantee a
specified overall accuracy while aiming to minimize the implementation cost in
terms of quantum gates. The core idea of our approach is to extract functions
that specify the optimization problem directly from the high-level description
of the quantum program. Then, custom compiler passes optimize these functions,
turning them into (near-)symbolic expressions for (1) the total error and (2)
the implementation cost (e.g., total quantum gate count). All unspecified
parameters of the quantum program will show up as variables in these
expressions, including accuracy parameters. After solving the corresponding
optimization problem, a circuit can be instantiated from the found solution. We
develop two prototype implementations, one in C++ based on Clang/LLVM, and
another using the Q# compiler infrastructure. We benchmark our prototypes on
typical quantum computing programs, including the quantum Fourier transform,
quantum phase estimation, and Shor's algorithm.
Related papers
- Bayesian Optimization Priors for Efficient Variational Quantum Algorithms [0.0]
Quantum computers currently rely on a quantum-classical approach known as Variational Quantum Algorithms (VQAs) to solve problems.
We propose a hybrid framework for basic computational optimization that reduces the number of shots per time is charged.
Using both proposed features, we show that using both proposed features statistically outperforms an implementation within VQAs for simulations.
arXiv Detail & Related papers (2024-06-20T18:00:12Z) - Indirect Quantum Approximate Optimization Algorithms: application to the
TSP [1.1786249372283566]
Quantum Alternating Operator Ansatz takes into consideration a general parameterized family of unitary operators to efficiently model the Hamiltonian describing the set of vectors.
This algorithm creates an efficient alternative to QAOA, where: 1) a Quantum parametrized circuit executed on a quantum machine models the set of string vectors; 2) a Classical meta-optimization loop executed on a classical machine; 3) an estimation of the average cost of each string vector computing.
arXiv Detail & Related papers (2023-11-06T17:39:14Z) - Fast Flux-Activated Leakage Reduction for Superconducting Quantum
Circuits [84.60542868688235]
leakage out of the computational subspace arising from the multi-level structure of qubit implementations.
We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation.
We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
arXiv Detail & Related papers (2023-09-13T16:21:32Z) - Error Mitigation for Quantum Approximate Optimization [0.0]
We show how a redundant encoding of logical variables can be exploited to mitigate errors in quantum optimization algorithms.
In the specific context of the quantum approximate optimization algorithm (QAOA), we show that errors can be significantly mitigated by appropriately modifying the objective cost function.
arXiv Detail & Related papers (2023-01-12T14:13:06Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Iteration Complexity of Variational Quantum Algorithms [5.684122393859336]
We argue that noise makes evaluations of the objective function via quantum circuits biased.
We derive the missing guarantees and find that the rate of convergence is unaffected.
arXiv Detail & Related papers (2022-09-21T19:18:41Z) - Unsupervised strategies for identifying optimal parameters in Quantum
Approximate Optimization Algorithm [3.508346077709686]
We study unsupervised Machine Learning approaches for setting parameters without optimization.
We showcase them within Recursive-QAOA up to depth $3$ where the number of QAOA parameters used per iteration is limited to $3$.
We obtain similar performances to the case where we extensively optimize the angles, hence saving numerous circuit calls.
arXiv Detail & Related papers (2022-02-18T19:55:42Z) - Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context.
Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
arXiv Detail & Related papers (2020-10-08T12:49:07Z) - Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices.
We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT)
Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
arXiv Detail & Related papers (2020-10-01T18:14:11Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20: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.