Efficient quantum algorithms for stabilizer entropies
- URL: http://arxiv.org/abs/2305.19152v3
- Date: Mon, 13 May 2024 12:40:41 GMT
- Title: Efficient quantum algorithms for stabilizer entropies
- Authors: Tobias Haug, Soovin Lee, M. S. Kim,
- Abstract summary: We efficiently measure stabilizer entropies (SEs) for integer R'enyi index $n>1$ via Bell measurements.
We provide efficient bounds of various nonstabilizerness monotones which are intractable to compute beyond a few qubits.
Our results open up the exploration of nonstabilizerness with quantum computers.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Stabilizer entropies (SEs) are measures of nonstabilizerness or `magic' that quantify the degree to which a state is described by stabilizers. SEs are especially interesting due to their connections to scrambling, localization and property testing. However, applications have been limited so far as previously known measurement protocols for SEs scale exponentially with the number of qubits. Here, we efficiently measure SEs for integer R\'enyi index $n>1$ via Bell measurements. The SE of $N$-qubit quantum states can be measured with $O(n)$ copies and $O(nN)$ classical computational time, where for even $n$ we additionally require the complex conjugate of the state. We provide efficient bounds of various nonstabilizerness monotones which are intractable to compute beyond a few qubits. Using the IonQ quantum computer, we measure SEs of random Clifford circuits doped with non-Clifford gates and give bounds for the stabilizer fidelity, stabilizer extent and robustness of magic. We provide efficient algorithms to measure Clifford-averaged $4n$-point out-of-time-order correlators and multifractal flatness. With these measures we study the scrambling time of doped Clifford circuits and random Hamiltonian evolution depending on nonstabilizerness. Counter-intuitively, random Hamiltonian evolution becomes less scrambled at long times which we reveal with the multifractal flatness. Our results open up the exploration of nonstabilizerness with quantum computers.
Related papers
- Magic spreading in random quantum circuits [0.0]
Calderbank-Shor-Steane entropy is a measure of non-stabilizerness.
Our main finding is that magic resources equilibrate on timescales logarithmic in system size N.
We conjecture that our findings describe the phenomenology of non-stabilizerness growth in a broad class of chaotic many-body systems.
arXiv Detail & Related papers (2024-07-04T13:43:46Z) - Probing quantum complexity via universal saturation of stabilizer entropies [0.0]
Nonstabilizerness or magic' is a key resource for quantum computing.
We show that stabilizer R'enyi entropies (SREs) saturate their maximum value at a critical number of non-Clifford operations.
arXiv Detail & Related papers (2024-06-06T15:46:35Z) - Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale.
Our experiments show that this approach significantly outperforms the adiabatic algorithm.
arXiv Detail & Related papers (2024-05-31T17:07:43Z) - Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits [0.824969449883056]
Bell sampling fails when used on quemphdits of dimension $d>2$.
We propose new quantum algorithms to circumvent the use of Bell sampling on qudits.
arXiv Detail & Related papers (2024-05-10T09:44:23Z) - The role of shared randomness in quantum state certification with
unentangled measurements [36.19846254657676]
We study quantum state certification using unentangled quantum measurements.
$Theta(d2/varepsilon2)$ copies are necessary and sufficient for state certification.
We develop a unified lower bound framework for both fixed and randomized measurements.
arXiv Detail & Related papers (2024-01-17T23:44:52Z) - Fast algorithms for classical specifications of stabiliser states and Clifford gates [14.947570152519281]
We show how to rapidly verify that a vector is a stabiliser state, and interconvert between its specification as amplitudes, a quadratic form, and a check matrix.
We provide example implementations of our algorithms in Python.
arXiv Detail & Related papers (2023-11-17T07:09:10Z) - Simulation of IBM's kicked Ising experiment with Projected Entangled
Pair Operator [71.10376783074766]
We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation.
Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture.
We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
arXiv Detail & Related papers (2023-08-06T10:24:23Z) - Iterative Qubits Management for Quantum Index Searching in a Hybrid
System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system.
We implement IQuCS with Qiskit and conduct intensive experiments.
Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z) - Scalable measures of magic resource for quantum computers [0.0]
We introduce efficient measures of magic resource for pure quantum states with a sampling cost independent of the number of qubits.
We show the transition of classically simulable stabilizer states into intractable quantum states on the IonQ quantum computer.
arXiv Detail & Related papers (2022-04-21T12:50:47Z) - Improved Graph Formalism for Quantum Circuit Simulation [77.34726150561087]
We show how to efficiently simplify stabilizer states to canonical form.
We characterize all linearly dependent triplets, revealing symmetries in the inner products.
Using our novel controlled-Pauli $Z$ algorithm, we improve runtime for inner product computation from $O(n3)$ to $O(nd2)$ where $d$ is the maximum degree of the graph.
arXiv Detail & Related papers (2021-09-20T05:56:25Z) - Debiased Sinkhorn barycenters [110.79706180350507]
Entropy regularization in optimal transport (OT) has been the driver of many recent interests for Wasserstein metrics and barycenters in machine learning.
We show how this bias is tightly linked to the reference measure that defines the entropy regularizer.
We propose debiased Wasserstein barycenters that preserve the best of both worlds: fast Sinkhorn-like iterations without entropy smoothing.
arXiv Detail & Related papers (2020-06-03T23:06:02Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.