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 Proceedings in Materials

Bounding the Electronic Correlation with Basic Linear Algebra

Alexander Odriazola, Norge Cruz Hernández

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-3-031-99987-1_14

Related papers

Elementary proofs of quantum lower bounds for element distinctness and k-sum

Andris Ambainis, Martins Kokainis

We give elementary proofs of the $Ω(n^{2/3})$ quantum query lower bound for element distinctness and the $Ω(n^{k/(k+1)})$ lower bound for the $k$-sum problem, for fixed $k$ and sufficiently large groups. The proofs use only basic properties of quantum states and linear algebra, analyzing the differences of algorithm states on different inputs.

quant-pharXiv:2610.32693•Oct 26, 2026•0 citations

INVESTIGATION OF ELECTRONIC CORRELATIONS

In Nanostructures

•Jan 1, 2003•0 citations

Electronic correlation in two-dimensional systems

Oracio Navarro, C. Wang

Surface Science•May 1, 1993•0 citations

Transformation to bond variables

Jayprokas Chakrabarti, Asis Basu, Bijan Kumar Bagchi

Valence bonds are the basic entities in many chemical compounds. In a linear array of atoms translational invariance tells us the bonds have to be superposed. These superposed bond variables are shown to satisfy a closed algebra. We use a natural parameter in the algebra to truncate it. This allows us to transform the Hamiltonian of electrons into the Hamiltonian of bonds. Comparing the solutions, we establish the validity of the truncation procedure. The quantum bonds are obtained by superposing valence bonds with arbitrary phases. We demonstrate that these quantum valence bonds satisfy an extended algebra that admits truncation. The electron Hamiltonian is recast in terms of the quantum bonds and solved.

Europhysics Letters (EPL)•May 1, 2002•1 citation

Techniques for Bounding Quantum Correlations

Michael J. W. Hall

Springer eBooks•Jan 1, 1997•2 citations

Linear-Algebra Based Quantum Machine Learning

Linear algebra-based quantum machine learning is based on quantum gates that describe quantum basic linear algebra subroutines. These subroutines can exhibit theoretical exponential speed ups over the classical counterparts and are essential for machine learning. The quantum basic linear algebra subroutines represent a quantum coprocessor for extensive and nontractable computation routines in machine learning. Such ‘mathematical’ quantum coprocessor can be used with a conventional computer.

WORLD SCIENTIFIC eBooks•Jul 15, 2020•0 citations
We give elementary proofs of the Ω(n2/3)Ω(n^{2/3})Ω(n2/3) quantum query lower bound for element distinctness and the Ω(nk/(k+1))Ω(n^{k/(k+1)})Ω(nk/(k+1)) lower bound for the kkk-sum problem, for fixed kkk and sufficiently large groups. The proofs use only basic properties of quantum states and linear algebra, analyzing the differences of algorithm states on different inputs.
Valence bonds are the basic entities in many chemical compounds. In a linear array of atoms translational invariance tells us the bonds have to be superposed. These superposed bond variables are shown to satisfy a closed algebra. We use a natural parameter in the algebra to truncate it. This allows us to transform the Hamiltonian of electrons into the Hamiltonian of bonds. Comparing the solutions, we establish the validity of the truncation procedure. The quantum bonds are obtained by superposing valence bonds with arbitrary phases. We demonstrate that these quantum valence bonds satisfy an extended algebra that admits truncation. The electron Hamiltonian is recast in terms of the quantum bonds and solved.