Related papers: Solving Superconducting Quantum Circuits in Dirac'…
The Dirac method is used to analyze the classical and quantum dynamics of a particle constrained on a circle. The method of Lagrange multipliers is scrutinized, in particular in relation to the quantization procedure. Ordering problems are…
We apply the Dirac factorization method to the nonrelativistic harmonic oscillator and, more in general, to Hamiltonians with a generic potential. It is shown that this procedure naturally leads to a supersymmetric formulation of the…
We propose an approach to solving constrained combinatorial optimization problems based on embedding the concept of Lagrangian duality into the framework of adiabatic quantum computation. Within the setting of circuit-model fault-tolerant…
The development of new superconducting circuits and the improvement of existing ones rely on the accurate modeling of spectral properties which are key to achieving the needed advances in qubit performance. Systematic circuit analysis at…
In terms of Dirac matrices the self-dual and anti-self-dual decomposition of a conformal supergravity is given and a self-dual conformal supergravity theory is developed as a connection dynamic theory in which the basic dynamic variabes…
Simulations of one quantum system by an other has an implication in realization of quantum machine that can imitate any quantum system and solve problems that are not accessible to classical computers. One of the approach to engineer…
The system of gravity coupled to the non-rotational dust field is studied at both classical and quantum levels. The scalar constraint of the system can be written in the form of a true physical Hamiltonian with respect to the dust time. In…
Starting from the QCD Lagrangian and taking into account both perturbative and nonperturbative effects, we use the method of vacuum correlators to derive the Dirac equation (rigorously for the Coulomb interaction and heuristically for the…
We present a new quantum adiabatic theorem that allows one to rigorously bound the adiabatic timescale for a variety of systems, including those described by unbounded Hamiltonians. Our bound is geared towards the qubit approximation of…
Discriminative Canonical Correlation Analysis (DCCA) is a powerful supervised feature extraction technique for two sets of multivariate data, which has wide applications in pattern recognition. DCCA consists of two parts: (i) mean-centering…
Universal speeded-up adiabatic geometric quantum computation~(SAGQC) is studied in $\Lambda$-type three-level system with different coupling cases, i.e., time-dependent detuning, large detuning and one-photon resonance couplings,…
Superconducting circuits are an extremely versatile platform to realize quantum information hardware and to emulate topological materials. We here show how a simple arrangement of capacitors and conventional…
Dirac's approach to the canonical quantization of constrained systems is applied to $N = 1$ supergravity, with or without gauged supermatter. Two alternative types of boundary condition applicable to quantum field theory or quantum gravity…
Digital-analog quantum computing (DAQC) is a universal computational paradigm that combines the evolution under an entangling Hamiltonian with the application of single-qubit gates. Since any unitary operation can be decomposed into a…
Along the years, supersymmetric quantum mechanics (SUSY QM) has been used for studying solvable quantum potentials. It is the simplest method to build Hamiltonians with prescribed spectra in the spectral design. The key is to pair two…
Hamiltonian constraints feature in the canonical formulation of general relativity. Unlike typical constraints they cannot be associated with a reduction procedure leading to a non-trivial reduced phase space and this means the physical…
We develop a Non-Crossing Approximation (NCA) for the effective cluster problem of the recently developed Dynamical Cluster Approximation (DCA). The DCA technique includes short-ranged correlations by mapping the lattice problem onto a…
By adding the total time derivatives of all the constraints to the Lagrangian step by step, we achieve the further work of the Dirac conjecture left by Dirac. Hitherto, the Dirac conjecture is proved completely. It is worth noticing that…
The relationship between the Dirac and reduced phase space quantizations is investigated for spin models belonging to the class of Hamiltonian systems having no gauge conditions. It is traced out that the two quantization methods may give…
In this paper, we propose a clean and general proof framework to establish the convergence analysis of the Difference-of-Convex (DC) programming algorithm (DCA) for both standard DC program and convex constrained DC program. We first…