Cover Image

Tensors, entanglement, separability, and their complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Friedland, Shmuel
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics 05C50, 15A69, 15A75, 68Q04, 68Q17, 68W25, 81P16, 81P40, 90C05, 90C08
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On semidefinite programming characterizations of the numerical radius and its dual norm
by: Friedland, Shmuel, et al.
Published: (2023)

A semidefinite programming characterization of the Crawford number
by: Friedland, Shmuel, et al.
Published: (2024)

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
by: Friedland, Shmuel
Published: (2023)

Complexity of Geometric programming in the Turing model and application to nonnegative tensors
by: Friedland, Shmuel, et al.
Published: (2023)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2023)

Optimal phase change for a generalized Grover's algorithm
by: Cardullo, Christopher, et al.
Published: (2025)

Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
by: Gribling, Sander, et al.
Published: (2025)

Laplacian Pair State Transfer on Total Graphs
by: Kalita, Akash, et al.
Published: (2026)

On 3-colorability of (claw, diamond)-free graphs
by: Hodur, Nadzieja, et al.
Published: (2026)

Decoherence time maximization and partial isolation for open quantum harmonic oscillator memory networks
by: Vladimirov, Igor G., et al.
Published: (2025)

Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
by: Roucairol, Milo, et al.
Published: (2024)

RotorMap and Quantum Fingerprints of DNA Sequences via Rotary Position Embeddings
by: Yakymenko, Danylo, et al.
Published: (2026)

Topological structure and a polynomial-time solution of linear programming over the real numbers
by: Wei, Jing-Yuan
Published: (2018)

A non-iterative polynomial algorithm for linear programming
by: Jing-Yuan, Wei
Published: (2013)

Distributed Computing for Huge-Scale Aggregative Convex Programming
by: Tao, Luoyi
Published: (2026)

A preconditioned inexact infeasible quantum interior point method for linear optimization
by: Wu, Zeguan, et al.
Published: (2024)

The Optimality of a Nested Generalized Pairwise Group Testing Procedure
by: Malinovsky, Yaakov, et al.
Published: (2025)

A quantum dual logarithmic barrier method for linear optimization
by: Wu, Zeguan, et al.
Published: (2024)

Optimal Scaling Quantum Interior Point Method for Linear Optimization
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2025)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
by: Petrov, Petar P.
Published: (2022)

Quantum Optimal Transport
by: Cole, Sam, et al.
Published: (2021)

Perfecting the Line Graph
by: Bal, Hartosh Singh
Published: (2025)

Quantum Computing in Logistics and Supply Chain Management an Overview
by: Phillipson, Frank
Published: (2024)

Feynman checkers: towards algorithmic quantum theory
by: Skopenkov, M., et al.
Published: (2020)

Mutual-visibility Coloring of Graphs
by: Babu, Saneesh, et al.
Published: (2025)

Peak state transfer in continuous quantum walks
by: Coutinho, Gabriel, et al.
Published: (2025)

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
by: Subiñas, Sergio Muñiz, et al.
Published: (2025)

Persistent Quantum Memory in Iterated Lifts
by: Bal, Hartosh Singh
Published: (2025)

Useful variants and perturbations of completely entangled subspaces and spans of unextendible product bases
by: Sengupta, Ritabrata, et al.
Published: (2024)

Towards a quantum synapse for quantum sensing
by: Pau, L-F
Published: (2025)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
by: Abdullah, Duaa, et al.
Published: (2025)

On the complexity of isomorphism problems for tensors, groups, and polynomials III: actions by classical groups
by: Chen, Zhili, et al.
Published: (2023)

Fractional revival on quasi-abelian Cayley graphs
by: Fang, Yi, et al.
Published: (2025)

Fractional revival on Cayley graphs over abelian groups
by: Wang, Jing, et al.
Published: (2022)

Degree Sequence Optimization and Extremal Degree Enumerators
by: Onn, Shmuel
Published: (2024)

Circuit and Graver Walks and Linear and Integer Programming
by: Onn, Shmuel
Published: (2024)

Periodic orbits on 2-regular circulant digraphs
by: Echols, Isaac, et al.
Published: (2024)

Dynamic T-decomposition for classical simulation of quantum circuits
by: Ahmad, Wira Azmoon, et al.
Published: (2024)

Advancing Mathematical Research via Human-AI Interactive Theorem Proving
by: Li, Chenyi, et al.
Published: (2025)

A generalization of quantum pair state transfer
by: Kim, Sooyeong, et al.
Published: (2024)