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

Springer series in solid-state sciences

How to Reduce Practically Any Problem to One Dimension

Daniel Charles Mattis

Published Jan 1, 1981• 4 citations
Publisher
DOI
10.1007/978-3-642-81592-8_1

Related papers

Penetration into Potential Barriers in Several Dimensions

P. L. KAPUR, Ronald F. Peierls

It is well known that in regions in which the refractive index varies sufficiently slowly, Schrodinger’s equation can be very simply treated by using its connexion with Hamilton-Jacobi’s differential equation. It is also known that a similar approximation is possible in regions of slowly varying imaginary refractive index (total reflexion). For the latter case the method was developed in papers by Jeffreys (1924), Wentzel (1926), Brillouin (1926) and Kramers (1926). These papers discuss also the behaviour of the wave function in the neighbourhood of the limit between the regions of real and imaginary refractive index. But although the connexion with the Hamilton-Jacobi equation holds in any number of dimensions, this equation can be solved by elementary means only in one dimension (or for problems that can by separation be reduced to one dimension), and for this reason the practical application of the method has so far been limited to one-dimensional or separable problems. In the present paper we discuss the case of more than one dimension and show that certain very simple inequalities may be obtained.

World Scientific series in 20th century physics•Apr 1, 1997•0 citations

Problems in One Dimension

Marko Horbatsch

Springer eBooks•Jan 1, 1995•0 citations

Penetration into potential barriers in several dimensions

P. L. Kapur, Ronald F. Peierls, Ralph Howard Fowler

Abstract It is well known that in regions in which the refractive index varies sufficiently slowly, Schrödinger’s equation can be very simply treated by using its connexion with Hamilton-Jacobi’s differential equation. It is also known that a similar approximation is possible in regions of slowly varying imaginary refractive index (total reflexion). For the latter case the method was developed in papers by Jeffreys (1924), Wentzel (1926), Brillouin (1926) and Kramers (1926). These papers discuss also the behaviour of the wave function in the neighbourhood of the limit between the regions of real and imaginary refractive index. But although the connexion with the Hamilton-Jacobi equation holds in any number of dimensions, this equation can be solved by elementary means only in one dimension (or for problems that can by separation be reduced to one dimension), and for this reason the practical application of the method has so far been limited to one-dimensional or separable problems. In the present paper we discuss the case of more than one dimension and show that certain very simple inequalities may be obtained.

Proceedings of the Royal Society of London A Mathematical and Physical Sciences•Dec 22, 1937•39 citations

One-Dimensional Problems

Franz Schwabl

Springer eBooks•Jan 1, 2002•0 citations

Reductions of QAOA Induced by Classical Symmetries: Theoretical Insights and Practical Implications

Boris Tsvelikhovskiy, Bao Bach, Jose Falla +1 more

The performance of the Quantum Approximate Optimization Algorithm (QAOA) is closely tied to the structure of the dynamical Lie algebra (DLA) generated by its Hamiltonians, which determines both its expressivity and trainability. In this work, we show that classical symmetries can be systematically exploited as a design principle for QAOA. Focusing on the MaxCut problem with global bit-flip symmetry, we analyze reduced QAOA instances obtained by fixing a single variable and study how this choice affects the associated DLAs. We show that the structure of the DLAs can change dramatically depending on which variable is held fixed. In particular, we construct explicit examples where the dimension collapses from exponential to quadratic, uncovering phenomena that do not appear in the original formulation. Numerical experiments on asymmetric graphs indicate that such reductions often produce DLAs of much smaller dimension, suggesting improved trainability. We also prove that any graph can be embedded into a slightly larger one (requiring only quadratic overhead) such that the standard reduced DLA coincides with the free reduced DLA, in most cases implying exponential dimension and irreducibility on the Hilbert space for reduced QAOA instances. These results establish symmetry-aware reduction as a principled tool for designing expressive and potentially trainable QAOA circuits.

quant-pharXiv:2602.16141•Feb 19, 2026•0 citations

Some Exact Results for the Many-Body Problem in one Dimension with Repulsive Delta-Function Interaction

Chongming Yang

The repulsive $\ensuremath{\delta}$ interaction problem in one dimension for $N$ particles is reduced, through the use of Bethe's hypothesis, to an eigenvalue problem of matrices of the same sizes as the irreducible representations $R$ of the permutation group ${S}_{N}$. For some $R'\mathrm{s}$ this eigenvalue problem itself is solved by a second use of Bethe's hypothesis, in a generalized form. In particular, the ground-state problem of spin-\textonehalf{} fermions is reduced to a generalized Fredholm equation.

Physical Review Letters•Dec 4, 1967•2,402 citations
It is well known that in regions in which the refractive index varies sufficiently slowly, Schrodinger’s equation can be very simply treated by using its connexion with Hamilton-Jacobi’s differential equation. It is also known that a similar approximation is possible in regions of slowly varying imaginary refractive index (total reflexion). For the latter case the method was developed in papers by Jeffreys (1924), Wentzel (1926), Brillouin (1926) and Kramers (1926). These papers discuss also the behaviour of the wave function in the neighbourhood of the limit between the regions of real and imaginary refractive index. But although the connexion with the Hamilton-Jacobi equation holds in any number of dimensions, this equation can be solved by elementary means only in one dimension (or for problems that can by separation be reduced to one dimension), and for this reason the practical application of the method has so far been limited to one-dimensional or separable problems. In the present paper we discuss the case of more than one dimension and show that certain very simple inequalities may be obtained.
Abstract It is well known that in regions in which the refractive index varies sufficiently slowly, Schrödinger’s equation can be very simply treated by using its connexion with Hamilton-Jacobi’s differential equation. It is also known that a similar approximation is possible in regions of slowly varying imaginary refractive index (total reflexion). For the latter case the method was developed in papers by Jeffreys (1924), Wentzel (1926), Brillouin (1926) and Kramers (1926). These papers discuss also the behaviour of the wave function in the neighbourhood of the limit between the regions of real and imaginary refractive index. But although the connexion with the Hamilton-Jacobi equation holds in any number of dimensions, this equation can be solved by elementary means only in one dimension (or for problems that can by separation be reduced to one dimension), and for this reason the practical application of the method has so far been limited to one-dimensional or separable problems. In the present paper we discuss the case of more than one dimension and show that certain very simple inequalities may be obtained.
The performance of the Quantum Approximate Optimization Algorithm (QAOA) is closely tied to the structure of the dynamical Lie algebra (DLA) generated by its Hamiltonians, which determines both its expressivity and trainability. In this work, we show that classical symmetries can be systematically exploited as a design principle for QAOA. Focusing on the MaxCut problem with global bit-flip symmetry, we analyze reduced QAOA instances obtained by fixing a single variable and study how this choice affects the associated DLAs. We show that the structure of the DLAs can change dramatically depending on which variable is held fixed. In particular, we construct explicit examples where the dimension collapses from exponential to quadratic, uncovering phenomena that do not appear in the original formulation. Numerical experiments on asymmetric graphs indicate that such reductions often produce DLAs of much smaller dimension, suggesting improved trainability. We also prove that any graph can be embedded into a slightly larger one (requiring only quadratic overhead) such that the standard reduced DLA coincides with the free reduced DLA, in most cases implying exponential dimension and irreducibility on the Hilbert space for reduced QAOA instances. These results establish symmetry-aware reduction as a principled tool for designing expressive and potentially trainable QAOA circuits.
The repulsive $\ensuremath{\delta}$ interaction problem in one dimension for NNN particles is reduced, through the use of Bethe's hypothesis, to an eigenvalue problem of matrices of the same sizes as the irreducible representations RRR of the permutation group SN{S}_{N}SN​. For some R′sR'\mathrm{s}R′s this eigenvalue problem itself is solved by a second use of Bethe's hypothesis, in a generalized form. In particular, the ground-state problem of spin-\textonehalf{} fermions is reduced to a generalized Fredholm equation.