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

Bulletin of the American Physical Society

Parity-Heap Transformations for Simulation of Fermionic Wavefunctions

M.M. Curtis, Nicholas C. Rubin, Eyob Alebachew Sete, William J. Zeng

Published Mar 14, 2017• 0 citations
OpenAlex

Related papers

Nodes of fermionic wavefunctions: coordinate transformations and topologies

Luboš Mitáš, Michal Bajdich, G. Drobný +1 more

Bulletin of the American Physical Society•Mar 23, 2005•0 citations

Quantum slant transform design for quantum neural network processing

Alexis A. Gomez, Artyom M. Grigoryan, Sos S. Agaian

The slant transformation extends the Fourier transformation by incorporating a linear phase modulation that introduces directional sensitivity and localized frequency response. This makes the slant transformation a valuable tool for image processing, pattern recognition, and signal encoding. In this work, we present a new implementation for the slant transformation using the quantum signal-induced heap transformation (QsiHT) and its corresponding QsiHT-based QR decomposition to realize the quantum slant transformation (QST). The QsiHT-QR approach decomposes the slant transformation into a sequence of unitary heap-based rotational transformations that encode the required linear phase modulation. This decomposition minimizes the use of multi-controlled rotations and eliminates redundant CNOT gates, which significantly reduces the circuit depth. The quantum algorithms for the 2- and 3-qubit cases are described in detail, providing the necessary foundations for generalizing the implementation to higher-order qubit systems. Using IBM’s Qiskit framework for quantum simulation, the proposed quantum algorithms are validated through a 4-qubit quantum neural network (QNN) architecture.

Multimodal Image Exploitation and Learning•Jun 9, 2026•0 citations

Quantum-Monte-Carlo simulations for fermionic systems

I. Morgenstern

The European Physical Journal B•Jun 1, 1989•14 citations

Quantum Signal‐Induced Heap Transform

Artyom M. Grigoryan, Sos S. Agaian

This chapter briefly describes the quantum signal-induced heap transform (QsiHT) related to the so-called discrete signal-induced heap transform (DsiHT), which was successfully used for image enhancement, classification, compression, and filtration. This transform is generated by any signal of arbitrary length. This transform is also used for different QR-decompositions of square matrices, real and complex. The chapter discusses applying DsiHT-based factorization techniques for real matrices, detailing how these methods can be implemented within quantum circuits to perform essential computations efficiently. It explores the extension of DsiHT to complex matrices, expanding its utility and effectiveness in handling a more comprehensive range of quantum computing tasks. The chapter provides a foundation for understanding how DsiHT and QR-decompositions can be leveraged to improve quantum algorithms' performance and accuracy, paving the way for more sophisticated applications in quantum image processing and other computational domains.

Wiley eBooks•Feb 10, 2025•0 citations

A proposal for Monte Carlo simulations of fermionic systems

Francesco Fucito, Enzo Marinari, Giorgio Parisi A +1 more

Nuclear Physics B•May 1, 1981•291 citations

Optimization and Quantum Simulation of Fermions

Maarten Stroeks

•May 6, 2026•0 citations
The slant transformation extends the Fourier transformation by incorporating a linear phase modulation that introduces directional sensitivity and localized frequency response. This makes the slant transformation a valuable tool for image processing, pattern recognition, and signal encoding. In this work, we present a new implementation for the slant transformation using the quantum signal-induced heap transformation (QsiHT) and its corresponding QsiHT-based QR decomposition to realize the quantum slant transformation (QST). The QsiHT-QR approach decomposes the slant transformation into a sequence of unitary heap-based rotational transformations that encode the required linear phase modulation. This decomposition minimizes the use of multi-controlled rotations and eliminates redundant CNOT gates, which significantly reduces the circuit depth. The quantum algorithms for the 2- and 3-qubit cases are described in detail, providing the necessary foundations for generalizing the implementation to higher-order qubit systems. Using IBM’s Qiskit framework for quantum simulation, the proposed quantum algorithms are validated through a 4-qubit quantum neural network (QNN) architecture.
This chapter briefly describes the quantum signal-induced heap transform (QsiHT) related to the so-called discrete signal-induced heap transform (DsiHT), which was successfully used for image enhancement, classification, compression, and filtration. This transform is generated by any signal of arbitrary length. This transform is also used for different QR-decompositions of square matrices, real and complex. The chapter discusses applying DsiHT-based factorization techniques for real matrices, detailing how these methods can be implemented within quantum circuits to perform essential computations efficiently. It explores the extension of DsiHT to complex matrices, expanding its utility and effectiveness in handling a more comprehensive range of quantum computing tasks. The chapter provides a foundation for understanding how DsiHT and QR-decompositions can be leveraged to improve quantum algorithms' performance and accuracy, paving the way for more sophisticated applications in quantum image processing and other computational domains.