Multiport Impedance Quantization

Firat Solgun; David P. DiVincenzo

doi:10.1016/j.aop.2015.07.005

Home/Archive/arXiv

arXiv · 1505.04116

Multiport Impedance Quantization

Firat Solgun·David P. DiVincenzo

View original source ↗Read source document ↗Export metadata ↓

Abstract

With the increase of complexity and coherence of superconducting systems made using the principles of circuit quantum electrodynamics, more accurate methods are needed for the characterization, analysis and optimization of these quantum processors. Here we introduce a new method of modelling that can be applied to superconducting structures involving multiple Josephson junctions, high-Q superconducting cavities, external ports, and voltage sources. Our technique, an extension of our previous work on single-port structures [1], permits the derivation of system Hamiltonians that are capable of representing every feature of the physical system over a wide frequency band and the computation of T1 times for qubits. We begin with a black box model of the linear and passive part of the system. Its response is given by its multiport impedance function Zsim(w), which can be obtained using a finite-element electormagnetics simulator. The ports of this black box are defined by the terminal pairs of Josephson junctions, voltage sources, and 50 Ohm connectors to high-frequency lines. We fit Zsim(w) to a positive-real (PR) multiport impedance matrix Z(s), a function of the complex Laplace variable s. We then use state-space techniques to synthesize a finite electric circuit admitting exactly the same impedance Z(s) across its ports; the PR property ensures the existence of this finite physical circuit. We compare the performance of state-space algorithms to classical frequency domain methods, justifying their superiority in numerical stability. The Hamiltonian of the multiport model circuit is obtained by using existing lumped element circuit quantization formalisms [2, 3]. Due to the presence of ideal transformers in the model circuit, these quantization methods must be extended, requiring the introduction of an extension of the Kirchhoff voltage and current laws.

Explore related subjects

quant-ph cond-mat.mes-hall cond-mat.supr-con

Keep this discovery

BibTeX RIS

Firat Solgun, David P. DiVincenzo. 2015-05-15. Multiport Impedance Quantization. https://doi.org/10.1016/j.aop.2015.07.005

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗

arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗

arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗