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 eBooks

Product of States

Klaus Fredenhagen

Published Jan 1, 1992• 1 citation
Publisher
DOI
10.1007/978-94-011-2801-8_17

Related papers

Minimum Uncertainty Product, Number-Phase Uncertainty Product, and Coherent States

R. Jackiw

The number-phase uncertainty products proposed by Carruthers and Nieto are studied to determine whether they are minimized by coherent states. It is found that coherent states do not minimize these products. States that do minimize some of the uncertainty products are constructed. Variational techniques for the study of arbitrary uncertainty products are developed.

Journal of Mathematical Physics•Mar 1, 1968•203 citations

States and effects

Springer eBooks•Apr 6, 2008•30 citations

Discrete states

Miros aw Lachowicz

Chapman & Hall/CRC eBooks•Aug 13, 2025•0 citations

Time evolution and deterministic optimization of correlator product states

Vid Stojevic, Philip J. D. Crowley, Tanja Đurić +2 more

We study a restricted class of correlator product states (CPS) for a spin-half chain in which each spin is contained in just two overlapping plaquettes. This class is also a restriction upon matrix product states (MPS) with local dimension ${2}^{n}$ ($n$ being the size of the overlapping regions of plaquettes) equal to the bond dimension. We investigate the trade-off between gains in efficiency due to this restriction against losses in fidelity. The time-dependent variational principle formulated for these states is numerically very stable. Moreover, it shows significant gains in efficiency compared to the naively related matrix product states---the evolution or optimization scales as ${2}^{3n}$ for the correlator product states versus ${2}^{4n}$ for the unrestricted matrix product state. However, much of this advantage is offset by a significant reduction in fidelity. Correlator product states break the local Hilbert space symmetry by the explicit selection of a local basis. We investigate this dependence in detail and formulate the broad principles under which correlator product states may be a useful tool. In particular, we find that scaling with overlap/bond order may be more stable with correlator product states allowing a more efficient extraction of critical exponents---we present an example in which the use of correlator product states is several orders of magnitude quicker than matrix product states.

arXiv:1604.07210•Physical review. B./Physical review. B•Oct 17, 2016•4 citations

Fully tolerant product state testing and closest product state learning

Zongbo Bao, Jonas Helsen, Tuyen Nguyen

We address the problem of testing whether an unknown $n$-qudit state $ρ$ is $a$-close to a product state or $b$-far away from any product state, as measured in terms of state overlap. We provide a time-efficient algorithm to solve this problem that requires an $n$-independent number of copies of the unknown state. Our random coloring argument shows that for any unknown state there always exists a partition of $[n]$ into $q$ parts such that the square of the overlap with the closest product state with respect to this partition is only an additive factor $O(1/q)$ larger. This reduces the problem to tolerant testing of $q$ parties, with potentially growing local dimensions. Combining this insight with blockwise spectral projection arguments we can show that the natural $k$-copy generalization of Harrow & Montanaro's product state test provides an efficient tolerant tester. We use the same random coloring and blockwise spectral projection techniques to obtain a substantially improved algorithm for closest product state learning. In particular we give an algorithm that takes in $\widetilde{O}\big((nd)^2\big)\, 2^{\widetilde{O}(1/\varepsilon^8)}$ copies of the unknown state and produces an $\varepsilon$-approximately optimal product state. The key technical components of this learner are a qudit variant of the Bakshi et al. high-fidelity product state learning algorithm and a sampling technique based on Werner's optimal cloning channel.

quant-pharXiv:2610.01979•Oct 2, 2026•1 citation

Approximating strongly correlated wave functions with correlator product states

Hitesh J. Changlani, Jesse Kinder, Cyrus J. Umrigar +1 more

We describe correlator product states, a class of numerically efficient many-body wave functions to describe strongly correlated wave functions in any dimension. Correlator product states introduce direct correlations between physical degrees of freedom in a simple way, yet provide the flexibility to describe a wide variety of systems. We show that many interesting wave functions can be mapped exactly onto correlator product states, including Laughlin's quantum Hall wave function, Kitaev's toric code states, and Huse and Elser's frustrated spin states. We also outline the relationship between correlator product states and other common families of variational wave functions such as matrix product states, tensor product states, and resonating valence-bond states. Variational calculations for the Heisenberg and spinless Hubbard models demonstrate the promise of correlator product states for describing both two-dimensional and fermion correlations. Even in one-dimensional systems, correlator product states are competitive with matrix product states for a fixed number of variational parameters.

arXiv:0907.4646•Physical Review B•Dec 22, 2009•122 citations
We study a restricted class of correlator product states (CPS) for a spin-half chain in which each spin is contained in just two overlapping plaquettes. This class is also a restriction upon matrix product states (MPS) with local dimension 2n{2}^{n}2n (nnn being the size of the overlapping regions of plaquettes) equal to the bond dimension. We investigate the trade-off between gains in efficiency due to this restriction against losses in fidelity. The time-dependent variational principle formulated for these states is numerically very stable. Moreover, it shows significant gains in efficiency compared to the naively related matrix product states---the evolution or optimization scales as 23n{2}^{3n}23n for the correlator product states versus 24n{2}^{4n}24n for the unrestricted matrix product state. However, much of this advantage is offset by a significant reduction in fidelity. Correlator product states break the local Hilbert space symmetry by the explicit selection of a local basis. We investigate this dependence in detail and formulate the broad principles under which correlator product states may be a useful tool. In particular, we find that scaling with overlap/bond order may be more stable with correlator product states allowing a more efficient extraction of critical exponents---we present an example in which the use of correlator product states is several orders of magnitude quicker than matrix product states.
We address the problem of testing whether an unknown nnn-qudit state ρρρ is aaa-close to a product state or bbb-far away from any product state, as measured in terms of state overlap. We provide a time-efficient algorithm to solve this problem that requires an nnn-independent number of copies of the unknown state. Our random coloring argument shows that for any unknown state there always exists a partition of [n][n][n] into qqq parts such that the square of the overlap with the closest product state with respect to this partition is only an additive factor O(1/q)O(1/q)O(1/q) larger. This reduces the problem to tolerant testing of qqq parties, with potentially growing local dimensions. Combining this insight with blockwise spectral projection arguments we can show that the natural kkk-copy generalization of Harrow & Montanaro's product state test provides an efficient tolerant tester. We use the same random coloring and blockwise spectral projection techniques to obtain a substantially improved algorithm for closest product state learning. In particular we give an algorithm that takes in O~((nd)2) 2O~(1/ε8)\widetilde{O}\big((nd)^2\big)\, 2^{\widetilde{O}(1/\varepsilon^8)}O((nd)2)2O(1/ε8) copies of the unknown state and produces an ε\varepsilonε-approximately optimal product state. The key technical components of this learner are a qudit variant of the Bakshi et al. high-fidelity product state learning algorithm and a sampling technique based on Werner's optimal cloning channel.
We describe correlator product states, a class of numerically efficient many-body wave functions to describe strongly correlated wave functions in any dimension. Correlator product states introduce direct correlations between physical degrees of freedom in a simple way, yet provide the flexibility to describe a wide variety of systems. We show that many interesting wave functions can be mapped exactly onto correlator product states, including Laughlin's quantum Hall wave function, Kitaev's toric code states, and Huse and Elser's frustrated spin states. We also outline the relationship between correlator product states and other common families of variational wave functions such as matrix product states, tensor product states, and resonating valence-bond states. Variational calculations for the Heisenberg and spinless Hubbard models demonstrate the promise of correlator product states for describing both two-dimensional and fermion correlations. Even in one-dimensional systems, correlator product states are competitive with matrix product states for a fixed number of variational parameters.