Local quenches in chaotic quantum systems produce a Renyi-index-tuned hierarchy of entanglement transitions, with S_alpha>1 obeying area law while S_alpha<=1 is volume-law, carried by an O(1)-dimensional dominant Schmidt sector that itself exhibits similar transitions at lower critical indices.
A polynomial quantum algorithm for approximating the
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
abstract
The Jones polynomial, discovered in 1984, is an important knot invariant in topology. Among its many connections to various mathematical and physical areas, it is known (due to Witten) to be intimately connected to Topological Quantum Field Theory (TQFT). The works of Freedman, Kitaev, Larsen and Wang provide an efficient simulation of TQFT by a quantum computer, and vice versa. These results implicitly imply the existence of an efficient quantum algorithm that provides a certain additive approximation of the Jones polynomial at the fifth root of unity, e^{2\pi i/5}, and moreover, that this problem is BQP-complete. Unfortunately, this important algorithm was never explicitly formulated. Moreover, the results mentioned are heavily based on TQFT, which makes the algorithm essentially inaccessible to computer scientists. We provide an explicit and simple polynomial quantum algorithm to approximate the Jones polynomial of an n-strands braid with m crossings at any primitive root of unity e^{2\pi i/k}, where the running time of the algorithm is polynomial in m,n and k. Our algorithm is based, rather than on TQFT, on well known mathematical results. By the results of Freedman et. al., our algorithm solves a BQP complete problem. The algorithm we provide exhibits a structure which we hope is generalizable to other quantum algorithmic problems. Candidates of particular interest are the approximations of other #P-hard problems, most notably, the partition function of the Potts model, a model which is known to be tightly connected to the Jones polynomial.
citation-role summary
method 1
citation-polarity summary
years
2026 4roles
method 1polarities
use method 1representative citing papers
Constrained Uniform Polynomial (CUP) and Constrained Adaptive Polynomial (CAP) solvers achieve lower error than standard QSVT and Chebyshev methods in noise-limited regimes by optimizing accuracy versus block-encoding normalization under uniform or moment-based spectral models.
Constrained optimal polynomials (CUP and CAP) reduce quantum linear system solver errors under noise by jointly optimizing approximation accuracy and block-encoding normalization, outperforming standard QSVT and Chebyshev-iteration solvers in numerical benchmarks.
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
citing papers explorer
-
Hierarchical entanglement transitions and hidden area-law sectors in quantum many-body dynamics
Local quenches in chaotic quantum systems produce a Renyi-index-tuned hierarchy of entanglement transitions, with S_alpha>1 obeying area law while S_alpha<=1 is volume-law, carried by an O(1)-dimensional dominant Schmidt sector that itself exhibits similar transitions at lower critical indices.
-
Constrained Optimal Polynomials for Quantum Linear System Solvers
Constrained Uniform Polynomial (CUP) and Constrained Adaptive Polynomial (CAP) solvers achieve lower error than standard QSVT and Chebyshev methods in noise-limited regimes by optimizing accuracy versus block-encoding normalization under uniform or moment-based spectral models.
-
Nonisothermal global-pressure exactness in fractured multiphase flow with aperture feedback
Constrained optimal polynomials (CUP and CAP) reduce quantum linear system solver errors under noise by jointly optimizing approximation accuracy and block-encoding normalization, outperforming standard QSVT and Chebyshev-iteration solvers in numerical benchmarks.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.