Numerical Gate Synthesis for Quantum Heuristics on Bosonic Quantum Processors

• URL: http://arxiv.org/abs/2201.07787v2
• Date: Mon, 8 Aug 2022 00:40:29 GMT
• Title: Numerical Gate Synthesis for Quantum Heuristics on Bosonic Quantum Processors
• Authors: A. Bar{\i}\c{s} \"Ozg\"uler, Davide Venturelli
• Abstract summary: We study the framework in the context of qudits which are controllable electromagnetic modes of a superconducting cavity system. We showcase control of single-qudit operations up to eight states, and two-qutrit operations, mapped respectively onto a single mode and two modes of the resonator.
• Score: 1.195496689595016
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: There is a recent surge of interest and insights regarding the interplay of quantum optimal control and variational quantum algorithms. We study the framework in the context of qudits which are, for instance, definable as controllable electromagnetic modes of a superconducting cavity system coupled to a transmon. By employing recent quantum optimal control approaches described in (Petersson and Garcia, 2021), we showcase control of single-qudit operations up to eight states, and two-qutrit operations, mapped respectively onto a single mode and two modes of the resonator. We discuss the results of numerical pulse engineering on the closed system for parametrized gates useful to implement Quantum Approximate Optimization Algorithm (QAOA) for qudits. The results show that high fidelity ($>$ 0.99) is achievable with sufficient computational effort for most cases under study, and extensions to multiple modes and open, noisy systems are possible. The tailored pulses can be stored and used as calibrated primitives for a future compiler in circuit quantum electrodynamics (cQED) systems.

Related papers

• 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)
• Optimal control in large open quantum systems: the case of transmon readout and reset [44.99833362998488]
  We present a framework that combines the adjoint state method together with reverse-time back-propagation to solve prohibitively large open-system quantum control problems. We apply this framework to optimize two inherently dissipative operations in superconducting qubits. Our results show that, given a fixed set of system parameters, shaping the control pulses can yield 2x improvements in the fidelity and duration for both of these operations.
  arXiv  Detail & Related papers  (2024-03-21T18:12:51Z)
• Sparse Probabilistic Synthesis of Quantum Operations [0.0]
  Many important quantum operations, such as continuous rotation gates in quantum computing or broadband pulses in NMR or MRI applications, can only be implemented approximately using finite quantum resources. This work develops an approach that enables -- at the cost of a modestly increased measurement repetition rate -- exact implementations on average.
  arXiv  Detail & Related papers  (2024-02-23T16:41:44Z)
• Quantum information processing with superconducting circuits: realizing and characterizing quantum gates and algorithms in open quantum systems [0.0]
  This thesis focuses on quantum information processing using the superconducting device. For the realization of quantum gates and algorithms, a one-step approach is used. We suggest faster and more efficient schemes for realizing $X$-rotation and entangling gates for two and three qubits.
  arXiv  Detail & Related papers  (2024-01-14T14:31:17Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Pulse-controlled qubit in semiconductor double quantum dots [57.916342809977785]
  We present a numerically-optimized multipulse framework for the quantum control of a single-electron charge qubit. A novel control scheme manipulates the qubit adiabatically, while also retaining high speed and ability to perform a general single-qubit rotation.
  arXiv  Detail & Related papers  (2023-03-08T19:00:02Z)
• On-the-fly Tailoring towards a Rational Ansatz Design for Digital Quantum Simulations [0.0]
  It is imperative to develop low depth quantum circuits that are physically realizable in quantum devices. We develop a disentangled ansatz construction protocol that can dynamically tailor an optimal ansatz. The construction of the ansatz may potentially be performed in parallel quantum architecture through energy sorting and operator commutativity prescreening.
  arXiv  Detail & Related papers  (2023-02-07T11:22:01Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Continuous quantum gate sets and pulse class meta-optimization [0.0]
  We show that learning families of optimal control pulses depend adaptively on various parameters, in order to obtain a global optimal mapping from the space of potential parameter values to the control space. Our proposed method is tested on different experimentally relevant quantum gates and proves capable of producing high-fidelity pulses even in presence of multiple variable or uncertain parameters with wide ranges.
  arXiv  Detail & Related papers  (2022-03-25T11:43:40Z)
• Pulse based Variational Quantum Optimal Control for hybrid quantum computing [0.0]
  This work studies pulse based variational quantum algorithms (VQAs) VQAs are designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware.
  arXiv  Detail & Related papers  (2022-02-17T21:43:54Z)
• 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.