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

Theoretical and Mathematical Physics

Representation of spinors by real and complex tensor aggregates

Vladimir A. Zhelnorovich

Published Jan 1, 1970• 6 citations
Publisher
DOI
10.1007/bf01028858

Related papers

Origin of Complex and Spinor Structures in Quantum Mechanics from Real Second-Order Dynamics

Pushpendra Singh

•Jan 1, 2026•0 citations

Algebraic and Quantum Mechanical Approach to Spinors

Tahir Manzoor, S. N. Hasan

Springer proceedings in mathematics & statistics•Nov 15, 2023•0 citations

自适应张量聚合的量子计算实现

Jincheng Zhang

This paper presents a novel quantum computing framework, termed "Adaptive Tensor Aggregation" (ATA), designed to accelerate quantum machine learning algorithms by leveraging adaptive tensor aggregation. Traditional quantum computation often struggles with the limitations of limited qubit resources, necessitating strategies for efficient tensor manipulation. ATA addresses these challenges through a dynamic adjustment of qubit count and state representation, guided by quantum entanglement and superposition. The core mechanism centers around a novel algorithm that iteratively adjusts the tensor aggregation level based on the current state of the system, optimizing for computational complexity and resource utilization. This approach allows for the efficient execution of complex tensor operations, crucial for many machine learning tasks. The proposed framework demonstrates significant improvements in performance compared to existing quantum algorithms, particularly in the context of large-scale tensor computations.

•Sep 3, 2026•0 citations

Quantum-mechanical description of “particles” with complex spin

V. I. Roginskii

Theoretical and Mathematical Physics•Feb 1, 1970•2 citations

Structured High-Angular-Momentum Coulomb Tensors from Real and Complex Solid-Harmonic Integral Engines: A Perspective

Bo Peng

Electron-repulsion integrals describe the Coulomb interaction between charge distributions built from orbital basis functions. Most integral algorithms generate these quantities through Cartesian Gaussian functions, whose angular shapes are written as powers of $x$, $y$, and $z$, and then transform the result to spherical functions. This route is effective, but from $d$ shells onward the Cartesian representation contains more functions than the spherical space required by the calculation. Direct real or complex solid-harmonic engines work in that target space from the beginning. They therefore produce a smaller final Coulomb tensor while preserving the ordering, phase, and magnetic-quantum-number labels that describe its angular structure. Following this structure beyond integral evaluation reveals direct connections to the algorithms that use the tensor. Simple analytical counts quantify tensor size, angular blocks, radial Slater--Condon parameters, and pair-space work. These quantities guide low-rank factorization, local Hamiltonian construction, quantum simulation, and transformations to spinor or effective-model bases. In this way, solid-harmonic integral engines provide a direct bridge between efficient integral generation and structured many-electron computation.

physics.chem-phCross-listedarXiv:2607.25245•Jul 29, 2026

Representation of Rotations in Three-Space by Complex 2×2 Matrices

Marshall J. Walker

A comparison is made between the representation of rotations in three dimensional space by real 3×3 matrices and complex 2×2 matrices. The relationship is used as a means of visualizing first-rank spinors.

American Journal of Physics•Apr 1, 1956•0 citations
This paper presents a novel quantum computing framework, termed "Adaptive Tensor Aggregation" (ATA), designed to accelerate quantum machine learning algorithms by leveraging adaptive tensor aggregation. Traditional quantum computation often struggles with the limitations of limited qubit resources, necessitating strategies for efficient tensor manipulation. ATA addresses these challenges through a dynamic adjustment of qubit count and state representation, guided by quantum entanglement and superposition. The core mechanism centers around a novel algorithm that iteratively adjusts the tensor aggregation level based on the current state of the system, optimizing for computational complexity and resource utilization. This approach allows for the efficient execution of complex tensor operations, crucial for many machine learning tasks. The proposed framework demonstrates significant improvements in performance compared to existing quantum algorithms, particularly in the context of large-scale tensor computations.
Electron-repulsion integrals describe the Coulomb interaction between charge distributions built from orbital basis functions. Most integral algorithms generate these quantities through Cartesian Gaussian functions, whose angular shapes are written as powers of xxx, yyy, and zzz, and then transform the result to spherical functions. This route is effective, but from ddd shells onward the Cartesian representation contains more functions than the spherical space required by the calculation. Direct real or complex solid-harmonic engines work in that target space from the beginning. They therefore produce a smaller final Coulomb tensor while preserving the ordering, phase, and magnetic-quantum-number labels that describe its angular structure. Following this structure beyond integral evaluation reveals direct connections to the algorithms that use the tensor. Simple analytical counts quantify tensor size, angular blocks, radial Slater--Condon parameters, and pair-space work. These quantities guide low-rank factorization, local Hamiltonian construction, quantum simulation, and transformations to spinor or effective-model bases. In this way, solid-harmonic integral engines provide a direct bridge between efficient integral generation and structured many-electron computation.