Gyrators for superconducting circuit design

arXiv:2610.22145 · quant-ph, cond-mat.mes-hall · Submitted 2026-10-15 · Read on arXiv

Listen

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: Today's paper: "Gyrators for superconducting circuit design".

Mira: The gist The formalism introduces a flux-charge symmetric Hamiltonian formalism that always admits a symplectic reduction for nonsingular, well-posed circuits involving gyrators, inductors, and capacitors (LCG circuits) with arbitrary non-linearity.

Kai: First, who's behind it and why it matters.

Paper summary: Kai: So we're wrapping up this look at "Gyrators for superconducting circuit design". The authors of this paper tackled the dynamics of circuits that include gyrators, inductors, and capacitors with arbitrary non-linearity.

Mira: They introduced a flux-charge symmetric Hamiltonian formalism to show that for any nonsingular, well-posed LCG circuit, there is always a symplectic reduction.

Lev: It’s about showing that even if the circuit is messy and non-linear, this formalism always lets you find a way to reduce it down to something simpler mathematically.

Kai: Exactly. The main point is they prove this symplectic reduction always exists for any nonsingular, well-posed LCG circuit #pg1.

Mira: And they introduce these duality notions and specific transformations that move reciprocal elements around the gyrators while keeping the whole Hamiltonian spectrum unchanged.

Lev: That means for real hardware, if you have a non-reciprocal setup, you can use those moves to map it onto a dynamically equivalent reciprocal circuit.

Kai: It’s about showing that gyrators aren't just noise; they can be represented in ways that simplify the structure of the circuit itself.

Mira: The implication is that we have better tools for understanding non-reciprocal components like Josephson junctions when they are part of a larger LCG system.

Lev: If this holds up for real hardware, it means we can design these systems knowing exactly how much overhead those gyrators introduce and if they’re actually necessary.

Kai: It's a solid foundation for understanding the dynamics of these mixed superconducting circuits, and it gives us concrete ways to simplify the actual physical design.

Mira: And because they found graph-theoretic conditions on the non-reciprocal coupling graph, we can classify circuits based on their structure—like if they have a forest or a bipartite NCG #pg1.

Lev: So if your circuit fits those structural rules, you might be able to build it without using any gyrators at all in the final realization.

Kai: It’s about moving from just building circuits to understanding the underlying mathematical structure that dictates what's possible.

Mira: And we’re going to look at how these gyrator reduction rules actually simplify those complex topologies, which is something Lev mentioned earlier.

Conclusion: Kai: So we're wrapping up this look at "Gyrators for superconducting circuit design."

Mira: The paper deals with how a specific mathematical framework, a flux-charge symmetric Hamiltonian, handles circuits that have gyrators, inductors, and capacitors with arbitrary non-linearity.

Lev: It’s about showing that even if the circuit gets messy and non-linear, this formalism always lets you find a way to reduce it down to something simpler mathematically.

Kai: Exactly. The main point is they prove this symplectic reduction always exists for any nonsingular, well-posed LCG circuit.

Mira: And they introduce these duality notions and specific transformations that move reciprocal elements around the gyrators while keeping the Hamiltonian spectrum exactly as it was.

Lev: That means for real hardware, if you have a non-reciprocal setup, you can use these transformations to map it onto something else that is dynamically equivalent but perhaps simpler in structure, like a purely reciprocal one.

Kai: It’s about showing that gyrators aren't just noise; they can be represented in ways that simplify the structure of the circuit itself.

Mira: The implication is that we have better tools for understanding non-reciprocal components like Josephson junctions when they are part of a larger LCG system.

Lev: If this holds up for real hardware, it means we can design these systems knowing exactly how much overhead those gyrators introduce and if they’re actually necessary.

Kai: It's a solid foundation for understanding the dynamics of these mixed superconducting circuits, and it gives us concrete ways to simplify the actual physical design.

Mira: And because they found graph-theoretic conditions on the non-reciprocal coupling graph, we can classify circuits based on their structure—like if they have a forest or a bipartite NCG.

Lev: So if your circuit fits those structural rules, you might be able to build it without using any gyrators at all in the final realization.

Kai: It’s about moving from just building circuits to understanding the underlying mathematical structure that dictates what's possible.

Mira: And we’re going to look at how these gyrator reduction rules actually simplify those complex topologies, which is something Lev mentioned earlier.

Princeton Quantum Initiative · Princeton University

quant-ph, cond-mat.mes-hall

Submitted: 2026-10-15

Updated: 2026-10-16

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 83/100

The gist: The gist The formalism introduces a flux-charge symmetric Hamiltonian formalism that always admits a symplectic reduction for nonsingular, well-posed circuits involving gyrators, inductors, and

Key concepts

Flux–Charge Symmetric Description: This is a specific mathematical framework using a Lagrangian that describes LCG circuits. It decomposes the total energy into terms related to magnetic flux and charge, allowing for canonical transformations that simplify the circuit's structure while preserving its essential physical properties.
Circuit Duality Transform: This transformation maps non-linear non-reciprocal circuits onto reciprocal ones. It involves specific substitutions between circuit variables (like $\phi_v \rightarrow q'_l$) and ensures that the numerical values of circuit parameters remain consistent across the duality mapping.
Non-Reciprocal Coupling Graph (NCG): This is a graph used to analyze how components in a circuit are coupled, particularly focusing on non-reciprocal elements. The structure of this graph dictates whether a circuit can be simplified; for instance, if the NCG is a forest, the circuit can be transformed into one without gyrators.
Reciprocally-Simulable Circuits: This means that a complex circuit containing gyrators can be dynamically equivalent to a simpler version that does not contain any gyrators. The paper proves that circuits with certain graph structures (like a forest NCG or bipartite NCG) possess this property, meaning the gyrator is merely a choice of representation.

Summary

The gist The formalism introduces a flux-charge symmetric Hamiltonian formalism that always admits a symplectic reduction for nonsingular, well-posed circuits involving gyrators, inductors, and capacitors (LCG circuits) with arbitrary non-linearity.

Flux–Charge Symmetric Description of Gyrators

The paper presents a flux-charge symmetric Lagrangian for LCG circuits that admits a symplectic reduction for any nonsingular, well-posed circuit regardless of non-linearity. This formalism encodes the circuit’s structural information in the Lagrangian and enables a series of canonical transformations on their Lagrangian. The energetic term is decomposed as E = X e∈C E C e (⟨qBe⟩) +X e∈I E I e (⟨eAϕ⟩). The contribution of a single gyrator to the Lagrangian is given by Lg = Gg 2 X u,v ϕuAe1uAe2vϕ˙ v − 1/2Gg X l,l′ qlBle1Bl'e2 q˙l'. The structure of the symplectic term admits a block structure reminiscent of (1.15).

Duality and Circuit Equivalence Transformations

The formalism introduces a notion of circuit duality on non-linear non-reciprocal circuits and a family of point transformations that inserts, removes, and moves reciprocal elements across gyrators while preserving the Hamiltonian spectrum. The LCG duality transform is an involutive mapping on circuits that acts unitarily on the Hamiltonian. This transformation involves substitutions such as ϕv → q'l and ql → ϕ'v, which are significant for the units in SI. The per-element rule for reciprocal components is then simply C∗e = Le and L∗e = Ce, preserving the numerical value of each scalar parameter across the dual map.

Reciprocally-Simulable Circuits

The paper establishes a graph-theoretic condition for reciprocal simulability by examining the non-reciprocal coupling graph (NCG). It proves that any circuit whose NCG is a forest admits a unitarily equivalent realization by capacitors, inductors and ideal transformers, and that when the NCG is a forest the realization contains no gyrators at all. Furthermore, for bipartite NCGs, any circuit with a bipartite NCG is reciprocally-simulable. This means that circuits with a forest NCG are reciprocally-simulable by a circuit containing no gyrators at all.

Gyrator Replacement Rules

The paper presents three notable configurations of two gyrators that may be replaced by a simpler element, including the series and parallel deletion rules, which combine two gyrators into a single gyrator with effective gyration ratio G∗. The cascade-to-transformer rule replaces two gyrators sharing an isolated RCC with a single ideal transformer. These transformations are point transformations on the Lagrangian and therefore canonical transformations after the Legendre transform.

Conclusion

The formalism guarantees the existence of a symplectic reduction for any nonsingular, well-posed LCG circuit with arbitrarily non-linear reciprocal one-port elements. The gyrator reduction rules act as canonical transformations on the circuit Lagrangian, and their composition provides a sufficient graph-theoretic condition for reciprocal simulability by the examination of the non-reciprocal coupling graph. It is proven that any circuit whose NCG is a forest graph is reciprocally-simulable by a circuit containing no gyrators at all. The classification of Section 4 sharpens the role of gyrators in circuit design: gyrators in a reciprocally-simulable circuit are a representational choice, while gyrators in a circuit that we cannot reduce may be dynamically necessary. The paper proves that any circuit with a bipartite NCG is reciprocally-simulable. The formalism always admits a Hamiltonian, and the symplectic reduction can be performed for any nonsingular, well-posed LCG circuit.

Improvements for AI systems

The AI system can perform Hamiltonian spectral analysis on non-reciprocal circuits using a flux-charge symmetric formalism that always admits a symplectic reduction for nonsingular, well-posed circuits involving gyrators, inductors, and capacitors (LCG circuits) with arbitrary non-linearity.
The system can identify constraints in circuit dynamics by distinguishing between null vector constraints (which reduce the size of the connection matrix without decreasing its rank) and Noether constraints (which encode symmetries).
The AI can simulate or design circuits that are reciprocally-simulable, meaning it can find a circuit of exclusively reciprocal elements whose Hamiltonian is unitarily related to the Hamiltonian of C.
The system can implement canonical transformations, such as the partial dual transformation, which extends Tellegen’s result to non-linear elements like Josephson junctions and quantum phase slips by allowing for continuous isospectral families of circuits.
The AI can classify circuit topologies using the non-reciprocal coupling graph (NCG), proving that if an NCG is a forest, the circuit is reciprocally-simulable by a circuit containing no gyrators at all.

Abstract

Assuming only the solubility of Kirchhoff's laws, the conservation of energy, and the form of the constitutive relations, we present a flux-charge symmetric Hamiltonian formalism that always admits a symplectic reduction for nonsingular, well-posed circuits involving gyrators, inductors, and capacitors (LCG circuits) with arbitrary non-linearity. The formalism introduces a notion of circuit duality on non-linear non-reciprocal circuits and a family of point transformations that inserts, removes, and moves reciprocal elements across gyrators while preserving the Hamiltonian spectrum. With these transformations, we extend Tellegen's classic result that gyrators make reciprocal elements behave as their dual to non-linear reciprocal elements such as the Josephson junction and quantum phase slip. Furthermore, we present conditions under which non-reciprocal circuits can be transformed to dynamically equivalent reciprocal circuits.