A fault-tolerant variational quantum algorithm with limited T-depth

• URL: http://arxiv.org/abs/2303.04491v1
• Date: Wed, 8 Mar 2023 10:31:12 GMT
• Title: A fault-tolerant variational quantum algorithm with limited T-depth
• Authors: Hasan Sayginel, Francois Jamet, Abhishek Agarwal, Dan E. Browne and Ivan Rungger
• Abstract summary: We propose a variational quantum eigensolver (VQE) algorithm that uses a fault-tolerant gate-set. VQE is suitable for implementation on a future error-corrected quantum computer.
• Score: 2.7648976108201815
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a variational quantum eigensolver (VQE) algorithm that uses a fault-tolerant gate-set, and is hence suitable for implementation on a future error-corrected quantum computer. VQE quantum circuits are typically designed for near-term, noisy quantum devices and have continuously parameterized rotation gates as the central building block. On the other hand, a fault-tolerant quantum computer can only implement a discrete set of logical gates, such as the so-called Clifford+T gates. We show that the energy minimization of VQE can be performed with such a fault-tolerant discrete gate-set, where we use the Ross-Selinger algorithm to transpile the continuous rotation gates to the error-correctable Clifford+T gate-set. We find that there is no loss of convergence when compared to the one of parameterized circuits if an adaptive accuracy of the transpilation is used in the VQE optimization. State preparation with VQE requires only a moderate number of T-gates, depending on the system size and transpilation accuracy. We demonstrate these properties on emulators for two prototypical spin models with up to 16 qubits. This is a promising result for the integration of VQE and more generally variational algorithms in the emerging fault-tolerant setting, where they can form building blocks of the general quantum algorithms that will become accessible in a fault-tolerant quantum computer.

Related papers

• YAQQ: Yet Another Quantum Quantizer -- Design Space Exploration of Quantum Gate Sets using Novelty Search [0.9932551365711049]
  We present a software tool for comparative analysis of quantum processing units and control protocols based on their native gates. The developed software, YAQQ (Yet Another Quantum Quantizer), enables the discovery of an optimized set of quantum gates.
  arXiv  Detail & Related papers  (2024-06-25T14:55:35Z)
• 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)
• Real-time error mitigation for variational optimization on quantum hardware [45.935798913942904]
  We define a Real Time Quantum Error Mitigation (RTQEM) algorithm to assist in fitting functions on quantum chips with VQCs. Our RTQEM routine can enhance VQCs' trainability by reducing the corruption of the loss function.
  arXiv  Detail & Related papers  (2023-11-09T19:00:01Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• Comparing planar quantum computing platforms at the quantum speed limit [0.0]
  We present a comparison of the theoretical minimal gate time, i.e., the quantum speed limit (QSL) for realistic two- and multi-qubit gate implementations in neutral atoms and superconducting qubits. We analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping.
  arXiv  Detail & Related papers  (2023-04-04T12:47:00Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era [0.0]
  Fault-tolerant quantum computation (FTQC) is essential to implement quantum algorithms in a noise-resilient way. In FTQC, a quantum circuit is decomposed into universal gates that can be fault-tolerantly implemented. In this paper, we propose that the Clifford+$T$ decomposition error for a given quantum circuit can be modeled as the depolarizing noise.
  arXiv  Detail & Related papers  (2023-01-10T19:00:01Z)
• Quantum Federated Learning with Entanglement Controlled Circuits and Superposition Coding [44.89303833148191]
  We develop a depth-controllable architecture of entangled slimmable quantum neural networks (eSQNNs) We propose an entangled slimmable QFL (eSQFL) that communicates the superposition-coded parameters of eS-QNNs. In an image classification task, extensive simulations corroborate the effectiveness of eSQFL.
  arXiv  Detail & Related papers  (2022-12-04T03:18:03Z)
• Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms [0.4677099525783277]
  computational capabilities of near-term quantum computers are limited by the noisy execution of gate operations and a limited number of physical qubits. Hybrid variational algorithms are well-suited to near-term quantum devices because they allow for a wide range of tradeoffs between the amount of quantum and classical resources used to solve a problem. This paper investigates tradeoffs available at both the algorithmic and hardware levels by studying a specific case.
  arXiv  Detail & Related papers  (2022-10-10T00:25:18Z)
• Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate [0.1759008116536278]
  In some applications access to a non-Clifford two-qubit gate can result in more optimal circuit decompositions. We demonstrate calibration of a low error non-Clifford Controlled-$fracpi2$ phase (CS) gate on a cloud based IBM Quantum computing.
  arXiv  Detail & Related papers  (2020-07-16T18:00:02Z)
• 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.