Quantum Cut
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Microsoft’s next-gen quantum chip cuts timeline to useful quantum computing
Microsoft’s new Majorana 2 quantum chip. Microsoft Microsoft claimed last year that it had made a key breakthrough in quantum computing with Majorana 1, the company's first quantum processor. While physicists were immediately skeptical of Microsoft's claims, the software giant is announcing Majorana 2 today, the next generation of its topological quantum chip.
Predictive surrogates could cut quantum computing measurement overhead by more than 99.97%
June 6, 2026 feature Predictive surrogates could cut quantum computing measurement overhead by more than 99.97% Ingrid Fadelli Author Sadie Harley Scientific Editor Robert Egan Associate Editor Quantum computers, systems that process information leveraging quantum mechanical effects, have the potential of outperforming classical computers on some tasks. Despite their potential, the use of these systems remains very limited, due to their high cost and other challenges that have so far...
Quantum Cut Sparsifiers
arXiv:2606.09728v1 Announce Type: cross Abstract: In this paper, we continue a line of research initiated by Basu, Brakensiek, and Putterman [2026] studying the sparsifiability of Hamiltonians. We focus particularly on the sparsifiability of the widely-studied Quantum Cut (QC) Hamiltonians. Our main result is that in an $n$-qubit system, any $n$-qubit QC Hamiltonian can be sparsified to $\widetilde{O}(n /\varepsilon^2)$
Quantum Algorithms for Triangle Cut Sparsification
arXiv:2606.06287v2 Announce Type: replace-cross Abstract: Triangles capture higher-order structures in graphs and are fundamental to applications such as clustering and network analysis. To enable efficient use of such structures at scale, we study the problem of triangle cut sparsification, which aims to reduce the graph size while approximately preserving triangle counts across every cut. We investigate quantum algorithms for this problem, using triangle listing as our main technical...
Quantum Algorithms for Triangle Cut Sparsification
arXiv:2606.06287v1 Announce Type: cross Abstract: Triangles capture higher-order structures in graphs and are fundamental to applications such as clustering and network analysis. To enable efficient use of such structures at scale, we study the problem of \emph{triangle cut sparsification}, which aims to reduce the graph size while approximately preserving triangle counts across every cut. We investigate \emph{quantum algorithms} for this problem, using triangle listing as our main technical...
Pseudoentanglement in constant depth: How trivial states can have non-trivial entanglement structure
arXiv:2605.31448v1 Announce Type: cross Abstract: We construct a family of 2D-local constant-depth quantum circuits that output states whose entanglement entropy across a specified cut cannot be estimated in quantum polynomial time. As constant-depth quantum circuits can be learned from polynomially many quantum samples, our resulting pseudoentangled states are implicitly public-key and not pseudorandom. This separates pseudoentanglement from pseudorandomness in the shallow-circuit regime:...
Nickelate superconductors share a common electronic fingerprint
Nickelate superconductors share a common electronic fingerprint Ingrid Fadelli Author Sadie Harley Scientific Editor Robert Egan Associate Editor Superconductors, materials that conduct electricity with zero electrical resistance at specific temperature ranges, have proved very promising for the development of quantum computers and other cutting-edge technologies. While most of these materials become superconducting at very low temperatures, others exhibit superconductivity at higher...