Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Physics A Mathematical and General

The parametrisation of quantisation rules equivalent to operator orderings, and the effect of different rules on the physical spectrum

Patrick Crehan

Published Apr 7, 1989• 11 citations
Publisher

Abstract

The author recalls the problem of choosing an ordering for the terms in a Hamiltonian of the form H(p, q) of finite dimension in p, q. He demonstrates that most orderings which provide one with a Hermitian operator are in fact redundant and he gives a general form for ordering rules in terms of arbitrary parameters. He concludes that differences in the choice of an ordering contribute differences to the physics which are only of order 2 and higher. He provides an example of a Hamiltonian for which the spectrum is explicitly dependent on the choice of quantisation rule (operator ordering). He compares the method of characterising operator ordering rules with that of Cohen (1966, 1970). Finally he generalises Cohen's method to the case of all linear quantisation rules and shows how his rule is a special case.

DOI
10.1088/0305-4470/22/7/013

Related papers

Non-Bloch band theory for finite banded non-Hermitian Toeplitz matrices

Yannick De Bruijn, Erik Orvehed Hiltunen

Non-Bloch band theory recovers the open-boundary spectrum of a non-Hermitian chain from its Bloch Hamiltonian evaluated along the generalised Brillouin zone rather than the unit circle. We develop its finite-size counterpart for banded Toeplitz matrices with real open-boundary spectrum. Reality of the spectrum forces the generalised Brillouin zone to be parametrised by an analytic polar curve, so the known sufficient condition for a real spectrum is also necessary under some mild non-degeneracy conditions. At finite size $n$, the eigenvalues of the original and the symmetrised Bloch Hamiltonians are given by samples at $n$ quantised momenta from the same limiting band, although separated by a phase mismatch of order $1/n$ which we obtain in closed form. Iterating this correction $K$ times yields a quantisation rule on the generalised Brillouin zone reproducing the finite spectrum with an error $\mathcal{O}(n^{-K-1})$ for any fixed $K$. At finite size, the generalised Brillouin zone itself is unchanged and only its parametrisation depends on $n$.

arXiv:2610.13715•Oct 9, 2026•0 citations

Dirac versus reduced quantization and operator ordering

K Shimizu

We show an equivalence between Dirac quantization and the reduced phase space quantization. The equivalence of the both quantization methods determines the operator ordering of the Hamiltonian. Some examples of the operator ordering are shown in simple models. I.

•Jan 26, 1996•1 citation

The Weyl correspondence and path integrals

Maurice M. Mizrahi

The method of Weyl transforms is used to rigorously derive path integral forms for position and momentum transition amplitudes from the time-dependent Schrödinger equation for arbitrary Hermitian Hamiltonians. It is found that all paths in phase space contribute equally in magnitude, but that each path has a different phase, equal to 1/h/ times an ’’effective action’’ taken along it. The latter is the time integral of p⋅q̇−h (p,q), h (p,q) being the Weyl transform of the Hamiltonian operator H, which differs from the classical Hamiltonian function by terms of order h/2, vanishing in the classical limit. These terms, which can be explicitly computed, are zero for relatively simple Hamiltonians, such as (1/2M)[P−eA (Q)]2+V (Q), but appear when the coupling of the position and momentum operators is stronger, such as for a relativistic spinless particle in an electromagnetic field, or when configuration space is curved. They are always zero if one opts for Weyl’s rule for forming the quantum operator corresponding to a given classical Hamiltonian. The transition amplitude between two position states is found to be expressible as a path integral in configuration space alone only in very special cases, such as when the Hamiltonian is quadratic in the momenta.

Journal of Mathematical Physics•Nov 1, 1975•131 citations

Dirac versus Reduced Quantization and Operator Ordering

K. Shimizu

We demonstrate an equivalence between Dirac quantization and reduced phase space quantization. The equivalence of the two quantization methods determines the operator ordering of the Hamiltonian. Some examples of the operator ordering are shown in simple models.

arXiv:gr-qc/9601042•Progress of Theoretical Physics•Jan 1, 1997•3 citations

Stabilizers for Compiling Quantum Channels under Hardware Constraints

Jack Weinberg

To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault tolerance --- how can we realize a relatively noiseless computation by cleverly combining noisy components? --- and compilation --- how can we realize an arbitrary quantum algorithm given the basic operations available on the quantum device at hand? We show how treating the former problem via error-correcting codes enables greater flexibility in resolving the latter. Specifically, we explicitly leverage the fact that error-correcting codes introduce redundancy which renders physically distinct operators logically indistinguishable. In terms of computation, it suffices to implement any operator logically equivalent to some target, yet from a compilation perspective, certain choices may be preferable to others. Our novel contribution is making this intuition precise in the general setting of the set of quantum channels. In particular, we describe how to reduce the problem of making a compilation-ideal choice to a convex optimization problem. In the special case of Hamiltonian compilation, we describe how to reduce the problem of making a compilation-ideal choice to a least squares problem and provide a closed form solution thereof. Using our framework, it is possible to circumvent inserting costly swaps to adhere to hardware connectivity; instead, we could realize the logical target through a distinct physical Hamiltonian that is natively accessible. We elucidate our approach to unitary compilation using the $[[4,2,2]]$ code.

•Jan 1, 2026•0 citations

Stabilizers for Compiling Logical Circuits under Hardware Constraints

Jack Weinberg, Narayanan Rengaswamy

To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault-tolerance -- how can we realize a relatively noiseless computation by cleverly combining noisy components? -- and compilation -- how can we realize an arbitrary quantum algorithm given the basic operations available on the quantum device at hand? We show how treating the former problem via error-correcting codes enables greater flexibility in resolving the latter. Specifically, we explicitly leverage the fact that error-correcting codes introduce redundancy which renders physically distinct operators logically indistinguishable. In terms of computation, it suffices to implement any operator logically equivalent to some target, yet from a compilation perspective, certain choices may be preferable to others. Our novel contribution is making this intuition precise in the general setting of the special unitary group. In particular, we describe how to reduce the problem of making a compilation-ideal choice to a least squares problem and provide a closed form solution thereof. Using our framework, it is possible to circumvent inserting costly swaps to adhere to hardware connectivity; instead, we could realize the logical target through a distinct physical Hamiltonian that is natively accessible. We elucidate our approach using the $[[4,2,2]]$ code. We discuss connections to compressed sensing that may pave the way to efficient compilation leveraging physical degrees of freedom.

quant-pharXiv:2604.25042•Apr 29, 2026•0 citations
The author recalls the problem of choosing an ordering for the terms in a Hamiltonian of the form H(p, q) of finite dimension in p, q. He demonstrates that most orderings which provide one with a Hermitian operator are in fact redundant and he gives a general form for ordering rules in terms of arbitrary parameters. He concludes that differences in the choice of an ordering contribute differences to the physics which are only of order 2 and higher. He provides an example of a Hamiltonian for which the spectrum is explicitly dependent on the choice of quantisation rule (operator ordering). He compares the method of characterising operator ordering rules with that of Cohen (1966, 1970). Finally he generalises Cohen's method to the case of all linear quantisation rules and shows how his rule is a special case.
Non-Bloch band theory recovers the open-boundary spectrum of a non-Hermitian chain from its Bloch Hamiltonian evaluated along the generalised Brillouin zone rather than the unit circle. We develop its finite-size counterpart for banded Toeplitz matrices with real open-boundary spectrum. Reality of the spectrum forces the generalised Brillouin zone to be parametrised by an analytic polar curve, so the known sufficient condition for a real spectrum is also necessary under some mild non-degeneracy conditions. At finite size nnn, the eigenvalues of the original and the symmetrised Bloch Hamiltonians are given by samples at nnn quantised momenta from the same limiting band, although separated by a phase mismatch of order 1/n1/n1/n which we obtain in closed form. Iterating this correction KKK times yields a quantisation rule on the generalised Brillouin zone reproducing the finite spectrum with an error O(n−K−1)\mathcal{O}(n^{-K-1})O(n−K−1) for any fixed KKK. At finite size, the generalised Brillouin zone itself is unchanged and only its parametrisation depends on nnn.
The method of Weyl transforms is used to rigorously derive path integral forms for position and momentum transition amplitudes from the time-dependent Schrödinger equation for arbitrary Hermitian Hamiltonians. It is found that all paths in phase space contribute equally in magnitude, but that each path has a different phase, equal to 1/h/ times an ’’effective action’’ taken along it. The latter is the time integral of p⋅q̇−h (p,q), h (p,q) being the Weyl transform of the Hamiltonian operator H, which differs from the classical Hamiltonian function by terms of order h/2, vanishing in the classical limit. These terms, which can be explicitly computed, are zero for relatively simple Hamiltonians, such as (1/2M)[P−eA (Q)]2+V (Q), but appear when the coupling of the position and momentum operators is stronger, such as for a relativistic spinless particle in an electromagnetic field, or when configuration space is curved. They are always zero if one opts for Weyl’s rule for forming the quantum operator corresponding to a given classical Hamiltonian. The transition amplitude between two position states is found to be expressible as a path integral in configuration space alone only in very special cases, such as when the Hamiltonian is quadratic in the momenta.
To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault tolerance --- how can we realize a relatively noiseless computation by cleverly combining noisy components? --- and compilation --- how can we realize an arbitrary quantum algorithm given the basic operations available on the quantum device at hand? We show how treating the former problem via error-correcting codes enables greater flexibility in resolving the latter. Specifically, we explicitly leverage the fact that error-correcting codes introduce redundancy which renders physically distinct operators logically indistinguishable. In terms of computation, it suffices to implement any operator logically equivalent to some target, yet from a compilation perspective, certain choices may be preferable to others. Our novel contribution is making this intuition precise in the general setting of the set of quantum channels. In particular, we describe how to reduce the problem of making a compilation-ideal choice to a convex optimization problem. In the special case of Hamiltonian compilation, we describe how to reduce the problem of making a compilation-ideal choice to a least squares problem and provide a closed form solution thereof. Using our framework, it is possible to circumvent inserting costly swaps to adhere to hardware connectivity; instead, we could realize the logical target through a distinct physical Hamiltonian that is natively accessible. We elucidate our approach to unitary compilation using the [[4,2,2]][[4,2,2]][[4,2,2]] code.
To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault-tolerance -- how can we realize a relatively noiseless computation by cleverly combining noisy components? -- and compilation -- how can we realize an arbitrary quantum algorithm given the basic operations available on the quantum device at hand? We show how treating the former problem via error-correcting codes enables greater flexibility in resolving the latter. Specifically, we explicitly leverage the fact that error-correcting codes introduce redundancy which renders physically distinct operators logically indistinguishable. In terms of computation, it suffices to implement any operator logically equivalent to some target, yet from a compilation perspective, certain choices may be preferable to others. Our novel contribution is making this intuition precise in the general setting of the special unitary group. In particular, we describe how to reduce the problem of making a compilation-ideal choice to a least squares problem and provide a closed form solution thereof. Using our framework, it is possible to circumvent inserting costly swaps to adhere to hardware connectivity; instead, we could realize the logical target through a distinct physical Hamiltonian that is natively accessible. We elucidate our approach using the [[4,2,2]][[4,2,2]][[4,2,2]] code. We discuss connections to compressed sensing that may pave the way to efficient compilation leveraging physical degrees of freedom.