Related papers: Synthesizing quantum circuits via numerical optimization

Synthesizing quantum circuits via numerical optimization

URL: http://arxiv.org/abs/2004.07714v1
Date: Thu, 16 Apr 2020 15:46:26 GMT
Title: Synthesizing quantum circuits via numerical optimization
Authors: Timoth\'ee Goubault de Brugi\`ere, Marc Baboulin, Beno\^it Valiron, Cyril Allouche
Abstract summary: We provide a framework for the synthesis of quantum circuits based on a numerical optimization algorithm. We derive theoretical lower bounds for the number of quantum gates required to implement any quantum algorithm.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We provide a simple framework for the synthesis of quantum circuits based on a numerical optimization algorithm. This algorithm is used in the context of the trapped-ions technology. We derive theoretical lower bounds for the number of quantum gates required to implement any quantum algorithm. Then we present numerical experiments with random quantum operators where we compute the optimal parameters of the circuits and we illustrate the correctness of the theoretical lower bounds. We finally discuss the scalability of the method with the number of qubits.

Related papers

A Quantum Approximate Optimization Method For Finding Hadamard Matrices [0.0]
We propose a novel qubit-efficient method by implementing the Hadamard matrix searching algorithm on a gate-based quantum computer. We present the formulation of the method, construction of corresponding quantum circuits, and experiment results in both a quantum simulator and a real gate-based quantum computer.
arXiv Detail & Related papers (2024-08-15T06:25:50Z)
Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity [1.0360348400670518]
We show that a minimal SWAP-gate count for executing a quantum circuit on a device emerges via the minimization of the distance between quantum states. This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing.
arXiv Detail & Related papers (2024-02-01T10:32:05Z)
Power Characterization of Noisy Quantum Kernels [52.47151453259434]
We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
arXiv Detail & Related papers (2024-01-31T01:02:16Z)
Quantum Circuit Optimization of Arithmetic circuits using ZX Calculus [0.0]
We propose a technique to optimize quantum arithmetic algorithms by reducing the hardware resources and the number of qubits based on ZX calculus. We are able to achieve a significant reduction in the number of ancilla bits and T-gates as compared to the originally required numbers to achieve fault-tolerance.
arXiv Detail & Related papers (2023-06-04T05:05:57Z)
Parallel circuit implementation of variational quantum algorithms [0.0]
We present a method to split quantum circuits of variational quantum algorithms (VQAs) to allow for parallel training and execution. We apply this specifically to optimization problems, where inherent structures from the problem can be identified. We show that not only can our method address larger problems, but that it is also possible to run full VQA models while training parameters using only one slice.
arXiv Detail & Related papers (2023-04-06T12:52:29Z)
Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z)
Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z)
Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z)
Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z)
Reducing the amount of single-qubit rotations in VQE and related algorithms [0.0]
We show that the number of single-qubit rotations in parameterized quantum circuits can be decreased without compromising the relative expressibility or entangling capability of the circuit. We also show that the performance of a variational quantum eigensolver is unaffected by a similar decrease in single-qubit rotations.
arXiv Detail & Related papers (2020-05-27T18:00:01Z)
Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.