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

Detecting full psd rank with GPT-5.6 Sol

Yaroslav Shitov

Published Aug 8, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.10762.22727

Related papers

Determining the tensor rank of (2, 2, m) matrix multiplication with GPT-5.6 Sol

Yaroslav Shitov

•Aug 30, 2026•2 citations

Some upper and lower bounds on PSD-rank

Troy Lee, Zhaohui Wei, Ronald de Wolf

arXiv:1407.4308•Mathematical Programming•Jul 16, 2016•32 citations

Separability of Hermitian tensors and PSD decompositions

Mareike Dressler, Jiawang Nie, Zi Yang

Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e. it is a sum of rank-1 psd Hermitian tensors. This paper studies how to detect the separability of Hermitian tensors. It is equivalent to the long-standing quantum separability problem in quantum physics, which asks to tell if a given quantum state is entangled or not. We formulate this as a truncated moment problem and then provide a semidefinite relaxation algorithm to solve it. Moreover, we study psd decompositions of separable Hermitian tensors. When the psd rank is low, we first flatten them into cubic order tensors and then apply tensor decomposition methods to compute psd decompositions. We prove that this method works well if the psd rank is low. In computation, this flattening approach can detect the separability for much larger-sized Hermitian tensors. This method is a good starting point to determine psd ranks of separable Hermitian tensors.

arXiv:2011.08132•Linear and Multilinear Algebra•Aug 27, 2021•11 citations

Tensor projection mechanism and algorithm implementation

Fei Wang, Wang Zhan-chang, Xiang Li +1 more

Applied Intelligence•Mar 26, 2021•0 citations

JPCUB Competitive Landscape v2.0: System-Level Joules-per-Solution Estimates for 17 Quantum Computing Platforms from Published Specifications

Rowan Brad Quni-Gudzinas

Companion paper to JPCUB P0 (DOI 10.5281/zenodo.21637028). Computes joules-per-solution (JPCUB) estimates for 17 quantum computing platforms from published specifications: 13 gate-model (7 superconducting, 4 trapped-ion, 2 neutral-atom) plus 2 annealing, 1 photonic, and 1 pre-commercial target. Key finding: gate speed dominates joules-per-solution. Superconducting platforms (0.05-0.71 J/sol) lead via 30-500 ns gates; neutral atoms (0.32-0.62 J/sol) balance Rydberg-gate speed with room-temperature operation; trapped ions (8.5-16.3 J/sol) rank last because 50-100 us gate times overwhelm the room-temperature power advantage. Only IBM Eagle has a published JPCUB (0.89 J/sol, P0). All other values are conservative system-level upper bounds pending independent measurement per JPCUB P0 adversarial validation provisions. Includes reproducible computation script and full specification-source traceability. Full text and updates: https://papers.qnfo.org/papers/jpcub-competitive-landscape/

•Aug 6, 2026•0 citations

Rank-based entanglement detection for bound entangled states

Aabhas Gulati

We develop a new method for entanglement detection in bipartite quantum states by using the violation of the rank-1-generated property of matrices. The positive-semidefinite matrices form a convex cone that has extremal elements of rank 1. But, convex conic subsets resulting from the presence of linear constraints allow extremal elements of rank >= 2. The problem of deciding when a matrix is rank-1 generated, i.e, a sum of rank-1 positive-semidefinite (PSD) matrices, has been studied extensively in optimization theory. This rank-1 generated property acts as an entanglement criterion, and we use this property to find novel classes of PPT (Positive under partial transposition) entangled states. We do this by mapping some faces of PPT density matrices to convex cones that are not rank-1 generated. We show that all separable states map to a rank-1 generated matrix. In general, the same is not true for the corresponding mapping of PPT entangled states. We also extend this approach to construct PPT entangled edge states. Finally, we provide witnesses that detect violations of the rank-1 generated property.

arXiv:2506.11346•Physical Review A•Jan 2, 2026•2 citations
Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e. it is a sum of rank-1 psd Hermitian tensors. This paper studies how to detect the separability of Hermitian tensors. It is equivalent to the long-standing quantum separability problem in quantum physics, which asks to tell if a given quantum state is entangled or not. We formulate this as a truncated moment problem and then provide a semidefinite relaxation algorithm to solve it. Moreover, we study psd decompositions of separable Hermitian tensors. When the psd rank is low, we first flatten them into cubic order tensors and then apply tensor decomposition methods to compute psd decompositions. We prove that this method works well if the psd rank is low. In computation, this flattening approach can detect the separability for much larger-sized Hermitian tensors. This method is a good starting point to determine psd ranks of separable Hermitian tensors.
Companion paper to JPCUB P0 (DOI 10.5281/zenodo.21637028). Computes joules-per-solution (JPCUB) estimates for 17 quantum computing platforms from published specifications: 13 gate-model (7 superconducting, 4 trapped-ion, 2 neutral-atom) plus 2 annealing, 1 photonic, and 1 pre-commercial target. Key finding: gate speed dominates joules-per-solution. Superconducting platforms (0.05-0.71 J/sol) lead via 30-500 ns gates; neutral atoms (0.32-0.62 J/sol) balance Rydberg-gate speed with room-temperature operation; trapped ions (8.5-16.3 J/sol) rank last because 50-100 us gate times overwhelm the room-temperature power advantage. Only IBM Eagle has a published JPCUB (0.89 J/sol, P0). All other values are conservative system-level upper bounds pending independent measurement per JPCUB P0 adversarial validation provisions. Includes reproducible computation script and full specification-source traceability. Full text and updates: https://papers.qnfo.org/papers/jpcub-competitive-landscape/
We develop a new method for entanglement detection in bipartite quantum states by using the violation of the rank-1-generated property of matrices. The positive-semidefinite matrices form a convex cone that has extremal elements of rank 1. But, convex conic subsets resulting from the presence of linear constraints allow extremal elements of rank >= 2. The problem of deciding when a matrix is rank-1 generated, i.e, a sum of rank-1 positive-semidefinite (PSD) matrices, has been studied extensively in optimization theory. This rank-1 generated property acts as an entanglement criterion, and we use this property to find novel classes of PPT (Positive under partial transposition) entangled states. We do this by mapping some faces of PPT density matrices to convex cones that are not rank-1 generated. We show that all separable states map to a rank-1 generated matrix. In general, the same is not true for the corresponding mapping of PPT entangled states. We also extend this approach to construct PPT entangled edge states. Finally, we provide witnesses that detect violations of the rank-1 generated property.