English
Related papers

Related papers: Nearly tight bounds for testing tree tensor networ…

200 papers

The numerical simulation of two-dimensional quantum many-body systems away from equilibrium constitutes a major challenge for all known computational methods. We investigate the utility of Tree Tensor Network (TTN) states to solve the…

Quantum Physics · Physics 2025-05-13 Wladislaw Krinitsin , Niklas Tausendpfund , Markus Heyl , Matteo Rizzi , Markus Schmitt

We study the problem of computing energy density in one-dimensional quantum systems. We show that the ground-state energy per site or per bond can be computed in time (i) independent of the system size and subexponential in the desired…

Strongly Correlated Electrons · Physics 2015-05-05 Yichen Huang

Quantum state exclusion is the task of identifying at least one state from a known set that was not used in the preparation of a quantum system. A set of quantum states is said to admit state exclusion if there exists a measurement whose…

Quantum Physics · Physics 2026-02-06 Debanjan Roy , Tathagata Gupta , Pratik Ghosal , Samrat Sen , Somshubhro Bandyopadhyay

In this paper, we present a new approach to study genuine tripartite entanglement existing in $(2\times 2\times n)-$dimensional quantum pure states. By utilizing the approach, we introduce a particular quantity to measure genuine tripartite…

Quantum Physics · Physics 2008-12-05 Chang-shui Yu , He-shan Song , Ya-hong Wang

Recently, trace distance measure of coherence has been proposed for characterizing the coherence of a given quantum state. However, it seems difficult to estimate the optimal incoherent state for high dimensional states. An explicit…

Quantum Physics · Physics 2016-10-25 Zhen Wang , Yan-Ling Wang , Zhi-Xi Wang

In this work, we study the sample complexity of two variants of product testing when restricted to single-copy measurements. In particular, we consider both bipartite product testing (i.e., does there exist at least one non-trivial cut…

Quantum Physics · Physics 2026-05-28 Jacob Beckey , Luke Coffman , Ariel Shlosberg , Louis Schatzki , Felix Leditzky

Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural…

Quantum Physics · Physics 2022-07-08 Antoine Girardin , Nicolas Brunner , Tamás Kriváchy

Reliable methods for the classification and quantification of quantum entanglement are fundamental to understanding its exploitation in quantum technologies. One such method, known as Separable Neural Network Quantum States (SNNS), employs…

Quantum Physics · Physics 2021-06-15 Cillian Harney , Mauro Paternostro , Stefano Pirandola

We describe a quantum-assisted machine learning (QAML) method in which multivariate data is encoded into quantum states in a Hilbert space whose dimension is exponentially large in the length of the data vector. Learning in this space…

Quantum Physics · Physics 2021-10-13 Michael L. Wall , Giuseppe D'Aguanno

The estimation of high dimensional quantum states is an important statistical problem arising in current quantum technology applications. A key example is the tomography of multiple ions states, employed in the validation of state…

Quantum Physics · Physics 2015-12-09 Cristina Butucea , Madalin Guta , Theodore Kypraios

Quantum state comparison, utilizing metrics like fidelity and trace distance, underpins the assessment of quantum networks within quantum information theory. While recent research has expanded theoretical understanding, incorporating error…

Quantum Algebra · Mathematics 2024-04-18 John T. M. Campbell , Nicola Marchetti , John Dooley , Indrakshi Dey

Quantum entanglement is a particularly useful characterization of topological orders which lack conventional order parameters. In this work, we study the entanglement in topologically ordered states between two arbitrary spatial regions,…

Strongly Correlated Electrons · Physics 2023-08-01 Chao Yin , Shang Liu

The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with $T$ gates whose underlying graph has treewidth $d$ can be simulated deterministically in…

Quantum Physics · Physics 2009-07-12 Igor L. Markov , Yaoyun Shi

Neural-Network Quantum States have been recently introduced as an Ansatz for describing the wave function of quantum many-body systems. We show that there are strong connections between Neural-Network Quantum States in the form of…

Quantum Physics · Physics 2018-03-08 Ivan Glasser , Nicola Pancotti , Moritz August , Ivan D. Rodriguez , J. Ignacio Cirac

I consider deterministic distinguishability of a set of orthogonal, bipartite states when only a single copy is available and the parties are restricted to local operations and classical communication, but with the additional requirement…

Quantum Physics · Physics 2009-11-13 Scott M. Cohen

As often emerges in various basic quantum properties such as R\'enyi and Tsallis entropies, the trace of quantum state powers $\text{tr}(\rho^q)$ has attracted a lot of attention. The recent work of Liu and Wang (SODA 2025) showed that,…

Quantum Physics · Physics 2026-04-03 Kean Chen , Yupan Liu , Qisheng Wang

We present a general method for converting any family of unsatisfiable CNF formulas that is hard for one of the simplest proof systems, tree resolution, into formulas that require large rank in any proof system that manipulates polynomials…

Computational Complexity · Computer Science 2009-12-04 Paul Beame , Trinh Huynh , Toniann Pitassi

We report the experimental measurement of bipartite quantum correlations of an unknown two-qubit state. Using a liquid state Nuclear Magnetic Resonance (NMR) setup and employing geometric discord, we evaluate the quantum correlations of a…

Accurate contraction of tensor networks beyond one dimension is essential in various fields including quantum many-body physics. Existing approaches typically rely on approximate contraction schemes and do not provide certified error bars.…

Strongly Correlated Electrons · Physics 2026-03-19 Seishiro Ono , Yanbai Zhang , Hoi Chun Po

It has been known for almost three decades that many $\mathrm{NP}$-hard optimization problems can be solved in polynomial time when restricted to structures of constant treewidth. In this work we provide the first extension of such results…

Computational Complexity · Computer Science 2016-02-09 Mateus de Oliveira Oliveira