© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:1111.0057 · Journal of Approximation Theory

The complexity of linear tensor product problems in (anti)symmetric Hilbert spaces

Markus Weimar

Published Jun 18, 2012• 10 citations

DOI: 10.1016/j.jat.2012.05.016

Related papers

Tensor Product Hilbert Spaces

WORLD SCIENTIFIC eBooks•Dec 7, 2017•1 citation

Tensor Product Hilbert Spaces

WORLD SCIENTIFIC eBooks•Sep 11, 2024•0 citations

Hilbert Space, Tensor Product, and Multi-Qubit

Hiu Yung Wong

Springer eBooks•Jan 1, 2022•0 citations

Hilbert Space, Tensor Product, and Multi-Qubit

Hiu Yung Wong

Springer eBooks•Jun 21, 2023•0 citations

Lower bound on the representation complexity of antisymmetric tensor product functions

Yuyang Wang, Yukuan Hu, Xin Liu

arXiv:2501.05958•Science China Mathematics•Mar 12, 2026•0 citations

Hardware-efficient fermionic simulation with a cavity-QED system

Yiğit Subaşı

Computation performed by applying a series of one and two qubit gates from a universal set and performing measurements on qubits.Computational complexity measured by the circuit-depth. Fermionic Embedding ProblemThe Hilbert space of n qubits is the tensor product of n 2-level Hilbert spaces.Each qubit is distinguishable.Fermions are indistinguishable particles with anti-symmetric wavefunctions.(Fermi-Dirac Statistics) Can we represent a fermionic system with a system of qubits?

•Feb 15, 2024•3 citations