< back to main site

Publications

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

Sayginel, H; Jamet, F; Agarwal, A; Browne, D E; Rungger, I (2024) A fault-tolerant variational quantum algorithm with limited T-depth. Quantum Science and Technology, 9 (1). 015015 ISSN 2058-9565

[thumbnail of eid10285.pdf]
Preview
Text
eid10285.pdf - Published Version
Available under License Creative Commons Attribution.

Download (2MB) | Preview

Abstract

We propose a variational quantum eigensolver (VQE) algorithm that uses a fault-tolerant (FT) 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, an FT quantum computer (FTQC) 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 an FT 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 FT setting, where they can form building blocks of the general quantum algorithms that will become accessible in an FTQC.

Item Type: Article
Keywords: fault-tolerance, variational quantum eigensolver, T-depth, optimization
Subjects: Quantum Phenomena > Quantum Information Processing and Communication
Divisions: Quantum Technologies
Identification number/DOI: 10.1088/2058-9565/ad0571
Last Modified: 16 Feb 2026 15:12
URI: https://eprintspublications.npl.co.uk/id/eprint/10285
View Item