Network-Based Quantum Computing: an Efficient Design Framework for Many-small-node Distributed Fault-Tolerant Quantum Computing

Abstract: In fault-tolerant quantum computing, a large number of physical qubits are required to construct a single logical qubit, and a single quantum node may be able to hold only a small number of logical qubits. In such a case, the idea of distributed fault-tolerant quantum computing (DFTQC) is important to demonstrate large-scale quantum computation […]

Matrix Low-dimensional Qubit Casting Based Quantum Electromagnetic Transient Network Simulation Program

Abstract: In modern power systems, the integration of converter-interfaced generations requires the development of electromagnetic transient network simulation programs (EMTP) that can capture rapid fluctuations. However, as the power system scales, the EMTP’s computing complexity increases exponentially, leading to a curse of dimensionality that hinders its practical application. Facing this challenge, quantum computing offers a […]

Control of a Josephson Digital Phase Detector via an SFQ-Based Flux Bias Driver

Abstract: Quantum computation requires high-fidelity qubit readout, preserving the quantum state. In the case of superconductings qubits, readout is typically performed using a complex analog experimental setup operating at room temperature, which poses significant technological and economic barriers to large system scalability. An alternative approach is to perform a cryogenic on-chip qubit readout based on […]

A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks

Quantum internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This article deals with the problem of scheduling in an arbitrary entanglement swapping quantum network—often called first-generation quantum network—in its general topology, multicommodity, loss-aware formulation. We introduce a linear algebraic framework […]

A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks

Quantum internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This article deals with the problem of scheduling in an arbitrary entanglement swapping quantum network—often called first-generation quantum network—in its general topology, multicommodity, loss-aware formulation. We introduce a linear algebraic framework […]

On the Stochastic Analysis of a Quantum Entanglement Distribution Switch

In this article, we study a quantum entanglement distribution switch that serves k users in a star topology. We model variants of the system as continuous-time Markov chains and obtain expressions for switch capacity, expected number of qubits stored in memory at the switch, and the quantum memory occupancy distribution. We obtain a number of analytic results […]