Solving Superconducting Quantum Circuits in Dirac's Constraint Analysis Framework

• URL: http://arxiv.org/abs/2308.10611v2
• Date: Tue, 22 Oct 2024 08:18:01 GMT
• Title: Solving Superconducting Quantum Circuits in Dirac's Constraint Analysis Framework
• Abstract summary: We study different types of Superconducting Quantum Circuits (SQC) in a itunified way. The Lagrangian of a SQC reveals the constraints, that are classified in a Hamiltonian framework. We have also analysed and predicted new results for a generic form of SQC.
• Score: 1.038595888464679
• License: http://creativecommons.org/licenses/by/4.0/
• 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 {\it{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.

Related papers

• Formal Verification of Continuous-Variable Quantum Programs [6.925649240526206]
  We provide a formal framework for Continuous-Variable Quantum Computing (CQC)<n>While CQC is supported by photonic quantum hardware, we are not aware of a formal semantics for CQC.<n>We implement a symbolic weakest-precondition CQC based on our logic.
  arXiv  Detail & Related papers  (2026-07-20T09:09:20Z)
• $K$-Theoretic Obstructions to Linearizing QCA Representations [8.162672407534899]
  We develop an obstruction theory for the linearization of QCA representations.<n>We also fully compute the homotopy types of the QCA spaces over a point, a line, and a plane.
  arXiv  Detail & Related papers  (2026-06-17T23:42:14Z)
• A Posteriori Certification Framework for Generalized Quantum Arimoto-Blahut Algorithms [41.15017547767954]
  We introduce an a posteriori certification viewpoint for the generalized quantum Arimoto-Blahut (QAB) algorithm.<n>We prove a global convergence theorem showing that, under convexity and a substantially weaker numerically verifiable condition, the QAB iteration converges to the global minimizer.<n>As an application, we develop a certified iterative scheme for computing the quantum relative entropy of channels.
  arXiv  Detail & Related papers  (2026-01-14T09:10:41Z)
• Quantum Circuit Reasoning Models: A Variational Framework for Differentiable Logical Inference [0.0]
  This report introduces a novel class of reasoning architectures, termed Quantum Circuit Reasoning Models (QCRM)<n>We show how logical rules can be encoded as unitary transformations over proposition-qubit states.<n>We propose the Quantum Reasoning Layer (QRL) as a differentiable hybrid component for composable reasoning models applicable to scientific, biomedical, and chemical inference domains.
  arXiv  Detail & Related papers  (2025-11-26T23:15:14Z)
• The Born Ultimatum: Conditions for Classical Surrogation of Quantum Generative Models with Correlators [1.397434225914932]
  Quantum Circuit Born Machines (QCBMs) are powerful quantum generative models that sample according to the Born rule.<n>Recent train-classical, deploy-quantum approaches propose training classical surrogates of QCBMs and using quantum devices only for inference.<n>We analyze the limitations of these methods arising from deployment discrepancies between classically trained and quantumly deployed parameters.
  arXiv  Detail & Related papers  (2025-11-03T18:51:24Z)
• Formal Verification of Variational Quantum Circuits [44.06507276521908]
  Variational quantum circuits (VQCs) are a central component of many quantum machine learning algorithms.<n>We present the first in-depth theoretical and practical study of the formal verification problem for VQCs.
  arXiv  Detail & Related papers  (2025-07-14T12:28:32Z)
• Routing Quantum Control of Causal Order [0.0]
  We show the existence of routed circuit decompositions for certain quantum processes with indefinite causal order.<n>We detail this construction explicitly and contrast it with other routed circuit decompositions of QC-QCs.<n>We conclude by pointing out how this connection can be useful to tackle various open problems in the field of indefinite causal order.
  arXiv  Detail & Related papers  (2025-07-11T17:43:54Z)
• Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure [49.1574468325115]
  We propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary. We make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section.
  arXiv  Detail & Related papers  (2025-04-22T16:10:34Z)
• Undecidable problems associated with variational quantum algorithms [2.8166046619628315]
  Variational Quantum Algorithms (VQAs) are widely studied as candidates for near-term quantum advantage. Recent work has shown that training VQAs is NP-hard in general. We present a conditional result suggesting that the training of VQAs is undecidable, even in idealized, noiseless settings.
  arXiv  Detail & Related papers  (2025-03-31T04:52:43Z)
• Circuit Quantisation in Hamiltonian Framework: A Constraint Analysis Approach [1.038595888464679]
  We apply Dirac's Constraint Analysis (DCA) to solve Superconducting Quantum Circuits (SQC) The Lagrangian of a SQC reveals the constraints, that are classified in a Hamiltonian framework. We demonstrate the robustness of DCA unlike certain other set of ideas like null vector and loop charge.
  arXiv  Detail & Related papers  (2024-10-21T13:56:58Z)
• Lindbladian reverse engineering for general non-equilibrium steady states: A scalable null-space approach [49.1574468325115]
  We introduce a method for reconstructing the corresponding Lindbaldian master equation given any target NESS. The kernel (null-space) of the correlation matrix corresponds to Lindbladian solutions. We illustrate the method in different systems, ranging from bosonic Gaussian to dissipative-driven collective spins.
  arXiv  Detail & Related papers  (2024-08-09T19:00:18Z)
• Formal Verification of Zero-Knowledge Circuits [44.99833362998488]
  Zero-knowledge circuits are sets of equality constraints over arithmetic expressions interpreted in a prime field. We make contributions to the problem of ensuring that a circuit correctly encodes a computation.
  arXiv  Detail & Related papers  (2023-11-15T10:47:28Z)
• Tractable Bounding of Counterfactual Queries by Knowledge Compilation [51.47174989680976]
  We discuss the problem of bounding partially identifiable queries, such as counterfactuals, in Pearlian structural causal models. A recently proposed iterated EM scheme yields an inner approximation of those bounds by sampling the initialisation parameters. We show how a single symbolic knowledge compilation allows us to obtain the circuit structure with symbolic parameters to be replaced by their actual values.
  arXiv  Detail & Related papers  (2023-10-05T07:10:40Z)
• Sufficient condition for universal quantum computation using bosonic circuits [44.99833362998488]
  We focus on promoting circuits that are otherwise simulatable to computational universality. We first introduce a general framework for mapping a continuous-variable state into a qubit state. We then cast existing maps into this framework, including the modular and stabilizer subsystem decompositions.
  arXiv  Detail & Related papers  (2023-09-14T16:15:14Z)
• Consistent Quantization of Nearly Singular Superconducting Circuits [0.0]
  We demonstrate the failure of the Dirac-Bergmann theory for the quantization of realistic, nearly singular superconducting circuits. The correct treatment of nearly singular systems involves a perturbative Born-Oppenheimer analysis. We find that the singular limit of this regularized analysis is, in many cases, completely unlike the singular theory.
  arXiv  Detail & Related papers  (2022-08-24T20:40:46Z)
• Decimation technique for open quantum systems: a case study with driven-dissipative bosonic chains [62.997667081978825]
  Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics. We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function. We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
  arXiv  Detail & Related papers  (2022-02-15T19:00:09Z)
• General Solution and Canonical Quantization of the Conic Path Constrained Second-Class System [0.0]
  We consider the problem of constrained motion along a conic path under a given external potential function. We perform the canonical quantization in a consistent way in terms of the corresponding Dirac brackets. The complete Dirac brackets algebra in phase space as well as its physical realization in terms of differential operators is explicitly obtained.
  arXiv  Detail & Related papers  (2022-02-15T13:46:56Z)
• A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher [0.0]
  We create a block cipher algorithm called HCA using a hybrid cellular automata (CA) mechanism to attain reversibility. Several evaluations and analyses performed on the model are presented here.
  arXiv  Detail & Related papers  (2021-06-09T02:52:05Z)
• Ansatz-Independent Variational Quantum Classifier [0.0]
  We show that variational quantum classifiers (VQCs) fit inside the well-known kernel method. We also propose a variational circuit realization (VCR) for designing efficient quantum circuits for a given unitary operator.
  arXiv  Detail & Related papers  (2021-02-02T21:25:39Z)
• Characterizing the loss landscape of variational quantum circuits [77.34726150561087]
  We introduce a way to compute the Hessian of the loss function of VQCs. We show how this information can be interpreted and compared to classical neural networks.
  arXiv  Detail & Related papers  (2020-08-06T17:48:12Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.