Fidelity under readout, drive, and circuit noise
The through-line is what counts as high fidelity when idle models, Y-factor rankings, and light-cone limits fail on superconducting qubits. Hardware papers overturn amplifier rankings with qubit-loop assignment fidelity for 4 K HEMT (indium phosphide high-electron-mobility transistor) low-noise amps, replace idle-frame gate theory with coherent rotations between instantaneous eigenstates set by the non-Abelian Berry connection, and train a deep Q-network (DQN)—a net that scores discrete drive choices from measured Pauli expectations—to learn sparse bang-bang pulses for pulse-level variational quantum eigensolver (ctrl-VQE) control, while a distribute–collapse error-detection scheme (encode into a GHZ ancilla, then local checks and postselection) recovers long-range entanglement for constant-depth dynamic circuits. In quantum information science, an even-distance Generalized Superfast Encoding (GSE) fermion-to-qubit map posts the first threshold-like circuit-noise memory scaling for that family.
Qubit-Based Benchmarking of InP HEMT LNAs: Readout Fidelity Versus Power Consumption
Read the notes Hide the notes
TL;DR Without a Josephson parametric amplifier, the 4 K HEMT LNA (channel high-electron-mobility transistor low-noise amp) dominates readout noise; qubit-loop IQ histograms overturn Y-factor ranking and show assignment fidelity peaking at 60% channel In, often at roughly an order of magnitude below typical dc bias power.
- Method: A qubit-in-the-loop benchmark ranks cryogenic LNAs by the two-dimensional IQ histogram of single-shot dispersive readout (in-phase/quadrature clouds that set SNR and state assignment), not by standalone Y-factor noise temperature (hot/cold load thermometry).
- Devices: Three state-of-the-art cryogenic HEMT LNAs with 53%, 60%, and 70% channel indium, plus a commercial reference, are compared in the same superconducting-qubit readout chain.
- Ranking mismatch: The 60% and 70% devices show similar , both better than 53%, and the 70% device has the highest gain, yet readout SNR and assignment fidelity (correct / label rate from the IQ clouds) instead peak at 60%.
- Power map: does not simply saturate with HEMT dc power and, for several devices, falls above a device-dependent bias well below typical operating points.
- Hardware takeaway: The best overall device (60%) needs about for ; across all four LNAs, appears at as little as about , guiding amp selection and bias under multi-qubit 4 K heat budgets.
Instantaneous-Frame Theory of Strongly Driven Parametric Gates
Read the notes Hide the notes
TL;DR Strongly driven parametric two-qubit gates are accurately described as coherent rotations between instantaneous eigenstates—not idle ones—with exchange and effective set by time-derivative couplings from the non-Abelian Berry connection (the geometric connection that couples moving eigenstates under flux change). The framework matches exact numerics across DTC, CSDTC, and STC tunable-coupler architectures, where idle-frame models fail at the large amplitudes needed for fast gates.
- Main result: In the instantaneous eigenbasis , an optimized parametric iSWAP—an AC-flux-activated swap—stays a clean two-level oscillation, whereas the idle eigenbasis shows a messy trajectory outside that manifold.
- Mechanism: Transitions come from time-derivative couplings , so the non-Abelian Berry connection supplies a compact expression for the exchange rate and the driven phase.
- Hardware scope: Quantitative agreement holds for double-transmon (DTC), capacitively shunted double-transmon (CSDTC), and single-transmon (STC) couplers, including exchange and accumulated versus drive amplitude.
- Design implication: Exact exchange exceeds the idle-frame estimate at large amplitude, so gates can run faster than naive idle-point theory predicts once the instantaneous-frame rate is used.
- Nonadiabatic ZZ: Averaged nonadiabatic , , is dominated by instantaneous-frame couplings of to and , and changes sign near drive frequencies set by the qubit anharmonicities.
Adaptive AI for Pulse-Level Quantum Control
Read the notes Hide the notes
TL;DR A deep Q-network agent (DQN: a neural net that scores discrete drive choices from measured Pauli expectations) learns ansatz-free, -step bang-bang pulses for ctrl-VQE—the pulse-level VQE that shapes microwave drives instead of compiling gates—on a simulated two-transmon problem. The learned policy beats random search on fidelity and energy error at hardware-compatible timing, and favors mostly idle, sparse drives—useful for cQED calibration when the continuous pulse landscape outruns GRAPE/CRAB-style model-based search.
- Main result: On a fixed-frequency, always-on-coupled two-transmon simulator of at (STO-3G), the DQN reaches peak state fidelity by within a window, while random search stays near – and peaks later ().
- Energy accuracy: Absolute gaps to full configuration interaction (FCI: the exact STO-3G ground energy) fall to , , and at , , and for DQN versus , , and for random search; only DQN enters the chemical-accuracy band by .
- Hardware loop: Each step, the agent observes Pauli expectation values and picks one of nine discrete amplitudes (full drive, idle, or opposite), matching typical AWG timing and a bang-bang restriction that turns pulse design into a discrete RL search.
- Learned pulses: At , the best DQN sequence idles on for of steps and almost never co-drives both qubits, resembling sparse bang-bang schedules that optimal-control theory often favors for fast state transfer.
- Scope: Training is model-free given a reward from energy drop relative to FCI, but the reported runs are classical Trotter simulations without decoherence or control noise; the authors flag finer or continuous amplitudes and hardware noise as next limits.
Resilience Beyond the Light Cone: Error-Detected Primitives for Practical Dynamic Circuits
Read the notes Hide the notes
TL;DR On superconducting hardware, a distribute–collapse error-detection scheme (encode a control into a GHZ ancilla, then reduce it with local checks and postselection) restores usable long-range entanglement for constant-depth dynamic circuits—mid-circuit measurement plus classical feedforward—without extra ancillas. A 100-qubit-chain Bell pair reaches above the entanglement threshold that the baseline dynamic circuit misses ().
- Main result: Error-detected distribute and collapse (constant-depth GHZ spread of a logical control, then parity reduction with check gadgets ) trade readout- and fusion-induced infidelity for postselection, with no added ancillas and only constant gate depth.
- Hardware win: On a superconducting processor, an error-detected long-range Bell pair across a 100-qubit chain achieves , while the unprotected dynamic-circuit baseline stays at and fails entanglement certification at .
- State prep: Constant-depth W-state preparation (equal superposition of single excitations) up to 20 qubits, by consuming GHZ resources up to 40 qubits, gains absolute fidelity at the largest sizes once error detection is on.
- cQED implication: Mid-circuit readout and feedforward latency—often worse than two-qubit gates on superconducting chips—are the bottleneck the scheme targets; implicit checks (redundant extraction that also flags collapse readout errors) typically beat explicit stabilizer checks when measurement is noisier than CNOTs.
- Bonus primitive: An error-detected Hadamard test (estimate via an ancilla interferometer) for an -qubit of depth runs in dynamic-circuit depth with one mid-circuit measurement/feedforward round, versus worst-case unitary depth .
First fault-tolerant quantum memory demonstration for a generalized superfast encoding
Read the notes Hide the notes
TL;DR An even-distance Generalized Superfast Encoding (GSE)—a fermion-to-qubit map whose stabilizers detect and correct errors—yields constant-weight (4 or 6) generators for any even , and simulated circuit-level memory for and shows a threshold near . This is the first fermion-mapping memory result with threshold-like scaling under circuit noise, not mere error detection.
- Main result: Circuit-level depolarizing memory simulations of the even-distance GSE instances and exhibit a threshold , the first fault-tolerant memory characterization of a fermion-to-qubit encoding with threshold-like scaling.
- Code construction: Each of fermionic modes sits in a -qubit ring block for even distance ; the resulting stabilizers keep weight 4 or 6 independent of .
- Syndrome schedule: The full stabilizer set partitions into four qubit-wise commuting groups, so syndrome extraction remains compact as distance grows.
- Decoder stack: AlphaSyndrome (a scheduler that packs bare-ancilla stabilizer checks into few layers) plus Relay-BP (belief-propagation decoding that relays soft messages across check rounds) underpin the simulated memory experiments.