Resilient superconducting-element design with genetic algorithms
- URL: http://arxiv.org/abs/2302.01837v1
- Date: Fri, 3 Feb 2023 16:24:35 GMT
- Title: Resilient superconducting-element design with genetic algorithms
- Authors: F. A. C\'ardenas-L\'opez, J. C. Retamal, Xi Chen, G. Romero, M. Sanz
- Abstract summary: Superconducting quantum circuits exhibit atomic energy spectrum and selection rules as ladder and three-level fabrication.
We show that our multi-loop circuits are robust under random fluctuation in their circuital parameters, i.e. under eventual flaws.
- Score: 3.53163169498295
- License: http://creativecommons.org/publicdomain/zero/1.0/
- Abstract: We present superconducting quantum circuits which exhibit atomic energy
spectrum and selection rules as ladder and lambda three-level configurations
designed by means of genetic algorithms. These heuristic optimization
techniques are employed for adapting the topology and the parameters of a set
of electrical circuits to find the suitable architecture matching the required
energy levels and relevant transition matrix elements. We analyze the
performance of the optimizer on one-dimensional single- and multi-loop circuits
to design ladder ($\Xi$) and lambda ($\Lambda$) three-level system with
specific transition matrix elements. As expected, attaining both the required
energy spectrum and the needed selection rules is challenging for single-loop
circuits, but they can be accurately obtained even with just two loops.
Additionally, we show that our multi-loop circuits are robust under random
fluctuation in their circuital parameters, i.e. under eventual fabrication
flaws. Developing an optimization algorithm for automatized circuit
quantization opens an avenue to engineering superconducting circuits with
specific symmetry to be used as modules within large-scale setups, which may
allow us to mitigate the well-known current errors observed in the first
generation of quantum processors.
Related papers
- Characterization, synthesis, and optimization of quantum circuits over
multiple-control $\textit{Z}$-rotation gates: A systematic study [4.385466953937176]
We study quantum circuits composed of multiple-control $Z$-rotation (MCZR) gates as primitives.
We present a gate-exchange strategy together with a flexible iterative algorithm for effectively optimizing the depth of any MCZR circuit.
arXiv Detail & Related papers (2023-04-18T06:34:18Z) - Computer-aided quantization and numerical analysis of superconducting
circuits [0.0]
We present work utilizing symbolic computer algebra and numerical diagonalization routines versatile enough to tackle a variety of circuits.
Results from this work are accessible through a newly released module of the scqubits package.
arXiv Detail & Related papers (2022-06-16T17:25:02Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Best-approximation error for parametric quantum circuits [0.13980986259786224]
In Variational Quantum Simulations, the construction of a suitable parametric quantum circuit is subject to two counteracting effects.
The number of parameters should be small for the device noise to be manageable, but also large enough for the circuit to be able to represent the solution.
To characterize such circuits, we estimate the best-approximation error using Voronoi diagrams.
arXiv Detail & Related papers (2021-07-15T15:09:16Z) - 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) - Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure
using a Separable Pair Approximation [0.0]
We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations.
The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms.
arXiv Detail & Related papers (2021-05-09T05:10:59Z) - Capacity and quantum geometry of parametrized quantum circuits [0.0]
Parametrized quantum circuits can be effectively implemented on current devices.
We evaluate the capacity and trainability of these circuits using the geometric structure of the parameter space.
Our results enhance the understanding of parametrized quantum circuits for improving variational quantum algorithms.
arXiv Detail & Related papers (2021-02-02T18:16:57Z) - 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) - Rapid characterisation of linear-optical networks via PhaseLift [51.03305009278831]
Integrated photonics offers great phase-stability and can rely on the large scale manufacturability provided by the semiconductor industry.
New devices, based on such optical circuits, hold the promise of faster and energy-efficient computations in machine learning applications.
We present a novel technique to reconstruct the transfer matrix of linear optical networks.
arXiv Detail & Related papers (2020-10-01T16:04:22Z) - 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) - Hardware-Encoding Grid States in a Non-Reciprocal Superconducting
Circuit [62.997667081978825]
We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code.
We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
arXiv Detail & Related papers (2020-02-18T16:45:09Z)
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.