arXiv subjects

Boyan Torosov

Publications and source records attributed to Boyan Torosov.

3 recordsLinked to original sources

arXiv2025

Optimization of High-Fidelity Single-Qubit Gates for Fluxoniums Using Single-Flux Quantum Control

We present a gradient-based method to construct memory-efficient, high-fidelity, single-qubit gates for fluxonium qubits. These gates are constructed using a sequence of single-flux quantum (SFQ) pulses that are sent to the qubit through either capacitive or inductive coupling. The schedule of SFQ pulses is constructed with an on-ramp and an off-ramp applied prior to and after a pulse train, where the pulses are spaced at intervals equal to the qubit period. We reduce the optimization problem to the scheduling of a fixed number of SFQ pulses in the on-ramp and solve it by relaxing the discretization constraint of the SFQ clock as an intermediate step, allowing the use of the Broyden-Fletcher-Goldfarb-Shanno optimizer. Using this approach, gate fidelities of 99.99 % can be achieved for inductive coupling and 99.9 % for capacitive coupling, with leakage being the main source of coherent errors for both approaches.

quant-ph↗

arXiv2024

Optimization of Two-Qubit Gates in Tunable-Coupler Architectures Using Single Flux Quantum Control

We present a gradient-based method to construct high-fidelity, two-qubit quantum gates in a system consisting of two transmon qubits coupled via a tunable coupler. In particular, we focus on single flux quantum (SFQ) pulses as a promising and scalable alternative to traditional control schemes that use microwave electronics. We develop a continuous embedding scheme to optimize these discrete pulses, taking advantage of auto-differentiation of our model. This approach allows us to achieve fSim-type gates with average gate fidelities on the order of 99.99% and CZ and CNOT gates with fidelities above 99.9%. Furthermore, we provide an alternative semi-analytical construction of these gates via an exact decomposition using a pair of fSim gates which leads to the reduction in memory required to store the associated pulse sequences.

quant-ph↗

arXiv2024

How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits. Nevertheless, there are significant outstanding challenges in quantum hardware, fabrication, software architecture, and algorithms on the path towards a full-stack scalable quantum computing technology. Here, we provide a comprehensive review of these scaling challenges. We show how to facilitate scaling by adopting existing semiconductor technology to build much higher-quality qubits, employing systems engineering approaches, and performing distributed heterogeneous quantum-classical computing. We provide a detailed resource and sensitivity analysis for quantum applications on surface-code error-corrected quantum computers given current, target, and desired hardware specifications based on superconducting qubits, accounting for a realistic distribution of errors. We provide comprehensive resource estimates for several utility-scale applications including quantum chemistry calculations, catalyst design, NMR spectroscopy, and Fermi-Hubbard simulation. We show that orders of magnitude enhancement in performance could be obtained by a combination of hardware improvements and tight quantum-HPC integration. Furthermore, we introduce high-performance architectures for quantum-probabilistic computing with custom-designed accelerators to tackle today's industry-scale classical optimization, machine learning, and quantum simulation tasks in a cost-effective manner.

quant-ph↗