Solving superconducting quantum circuits in Dirac's constraint analysis framework*

Abstract In this work we exploit Dirac's Constraint Analysis (DCA) in Hamiltonian formalism to study different types of Superconducting Quantum Circuits (SQC) in a unified way. The Lagrangian of a SQC reveals the constraints, that are classified in a Hamiltonian framework, such that redundant variables can be removed to isolate the canonical degrees of freedom for subsequent quantization of the Dirac Brackets via a generalized Correspondence Principle. This purely algebraic approach makes the application of concepts such as graph theory, null vector, loop charge, etc that are in vogue, (each for a specific type of circuit), completely redundant. The universal validity of DCA scheme in SQC, proposed by us, is demonstrated by correctly re-deriving existing results for different SQCs, obtained previously exploiting different formalisms each applicable for a specific SQC. Furthermore, we have also analysed and predicted new results for a generic form of SQC - it will be interesting to see its validation in an explicit circuit implementation.

Authors

Institutions

Publication Details

Journal
Physica Scripta
Published
2024-10-17
DOI
https://doi.org/10.1088/1402-4896/ad8842
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.69
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Solving superconducting quantum circuits in Dirac's constraint analysis framework*

Akshat Pandey, Subir Ghosh
2 citations
Physica Scripta
Quantum Computing Algorithms and Architecture
0.69
article

Solving superconducting quantum circuits in Dirac's constraint analysis framework*

Akshat Pandey, Subir Ghosh
article en
2 citations

Abstract

Abstract In this work we exploit Dirac's Constraint Analysis (DCA) in Hamiltonian formalism to study different types of Superconducting Quantum Circuits (SQC) in a unified way. The Lagrangian of a SQC reveals the constraints, that are classified in a Hamiltonian framework, such that redundant variables can be removed to isolate the canonical degrees of freedom for subsequent quantization of the Dirac Brackets via a generalized Correspondence Principle. This purely algebraic approach makes the application of concepts such as graph theory, null vector, loop charge, etc that are in vogue, (each for a specific type of circuit), completely redundant. The universal validity of DCA scheme in SQC, proposed by us, is demonstrated by correctly re-deriving existing results for different SQCs, obtained previously exploiting different formalisms each applicable for a specific SQC. Furthermore, we have also analysed and predicted new results for a generic form of SQC - it will be interesting to see its validation in an explicit circuit implementation.

Physica ScriptaVol. 99(12)
Indian Statistical Institute (IN)
Openalex Percentile: Top 24%
Quantum Computing Algorithms and Architecture
0.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.