# Sublinear quantum algorithms for estimating von Neumann entropy

@article{Gur2021SublinearQA, title={Sublinear quantum algorithms for estimating von Neumann entropy}, author={Tom Gur and Min-Hsiu Hsieh and Sathyawageeswar Subramanian}, journal={Electron. Colloquium Comput. Complex.}, year={2021}, volume={28}, pages={174} }

Entropy is a fundamental property of both classical and quantum systems, spanning myriad theoretical and practical applications in physics and computer science. We study the problem of obtaining estimates to within a multiplicative factor γ > 1 of the Shannon entropy of probability distributions and the von Neumann entropy of mixed quantum states. Our main results are: In both cases, the input is assumed to have entropy bounded away from zero by a quantity determined by the parameter η > 0…

## 4 Citations

The Existence of Barren Plateaus in The Detection of Quantum Entanglement

- Mathematics
- 2022

. Many entanglement measures are ﬁrst deﬁned for pure states of a bipartite Hilbert space, and then extended to mixed states via the convex roof extension. In this article we alter the convex roof…

Constant-time one-shot testing of large-scale graph states

- Computer Science
- 2022

This work constructs an efficient alternative framework for testing graph states for fault-tolerant MBQC based on the theory of property testing and achieves a significant advantage over prior art for graph-state verification in the number of qubits and the total runtime.

Efficient and practical quantum compiler towards multi-qubit systems with deep reinforcement learning

- Computer ScienceArXiv
- 2022

The proposed protocol is compatible with various quantum machines and can be used to compile multi-qubit operators and opens an avenue for integrating RL with quantum compiling to unify eﬃciency and practicality and thus facilitate the exploration of quantum advantages.

New Quantum Algorithms for Computing Quantum Entropies and Distances

- Computer ScienceArXiv
- 2022

A novel technique for eigenvalue transformation of density operators and their (non-integer) positive powers, based on the powerful quantum singular value transformation (QSVT) is introduced, which is useful in other quantum algorithms.

## References

SHOWING 1-10 OF 43 REFERENCES

Measuring Quantum Entropy

- Computer Science2019 IEEE International Symposium on Information Theory (ISIT)
- 2019

For von Neumann entropy and Rényi entropy of non-integral orders, the upper and lower bounds on the sample complexity of the Empirical Young Diagram (EYD) algorithm are provided, which is the analogue of the empirical plug-in estimator in classical estimation.

Quantum algorithm for estimating
α
-Renyi entropies of quantum states

- Computer SciencePhysical Review A
- 2021

We describe a quantum algorithm to estimate the alpha-Renyi entropy of an unknown d-dimensional density matrix, for alpha not equal to 1, by combining the recent technique of quantum singular value…

Distributional property testing in a quantum world

- Computer Science, PhysicsITCS
- 2020

The presented approach is a natural fit for distributional property testing both in the classical and the quantum case, demonstrating the first speed-ups for testing properties of density operators that can be accessed coherently rather than only via sampling.

Optimal Hamiltonian Simulation by Quantum Signal Processing.

- PhysicsPhysical review letters
- 2017

It is argued that physical intuition can lead to optimal simulation methods by showing that a focus on simple single-qubit rotations elegantly furnishes an optimal algorithm for Hamiltonian simulation, a universal problem that encapsulates all the power of quantum computation.

The complexity of approximating entropy

- Computer Science, MathematicsSTOC '02
- 2002

It is shown that a λ-multiplicative approximation to the entropy can be obtained in O(n(1+η)/λ2 < poly(log n)) time for distributions with entropy Ω(λ η), where n is the size of the domain of the distribution and η is an arbitrarily small positive constant.

Quantum Algorithms for Classical Probability Distributions

- Computer Science, MathematicsESA
- 2019

It is proved that quantum query complexity of distinguishing two probability distributions is given by their inverse Hellinger distance, which gives a quadratic improvement over classical query complexity for any pair of distributions.

Quantum Spectrum Testing

- MathematicsSTOC
- 2015

This work shows that given a mixed state ρ ∈ Cd x d: Θ(d/ε2) copies are necessary and sufficient to test whether ρ is the maximally mixed state, i.e., has spectrum (1/d, ..., 1/d).

Quantum Algorithms for Testing Properties of Distributions

- Computer ScienceIEEE Transactions on Information Theory
- 2011

It is shown that the L-distance ∥p-q∥<sub>1</sub> can be estimated with a constant precision using only O(N-1/2) queries in the quantum settings, whereas classical computers need Ω(N<sup>1-o</sup>(1)) queries.

Quantum State Merging and Negative Information

- Computer Science
- 2006

A quantum state shared between many distant locations is considered, and a quantum information processing primitive, state merging, that optimally merges the state into one location is defined, finding that quantum information can be negative.

Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics

- Computer Science, MathematicsSTOC
- 2019

A new “Quantum singular value transformation” algorithm is developed that can directly harness the advantages of exponential dimensionality by applying polynomial transformations to the singular values of a block of a unitary operator.