Handbook for Efficiently Quantifying Robustness of Magic
- URL: http://arxiv.org/abs/2311.01362v2
- Date: Thu, 14 Dec 2023 23:39:20 GMT
- Title: Handbook for Efficiently Quantifying Robustness of Magic
- Authors: Hiroki Hamaguchi and Kou Hamada and Nobuyuki Yoshioka
- Abstract summary: Robustness of magic (RoM) characterizes the degree of usefulness of a given quantum state for non-Clifford operation.
We present efficient novel algorithms to compute the RoM.
We numerically demonstrate our state-of-the-art results for copies of magic states and partially disentangled quantum states.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The nonstabilizerness, or magic, is an essential quantum resource to perform
universal quantum computation. Robustness of magic (RoM) in particular
characterizes the degree of usefulness of a given quantum state for
non-Clifford operation. While the mathematical formalism of RoM can be given in
a concise manner, it is extremely challenging to determine the RoM in practice,
since it involves superexponentially many pure stabilizer states. In this work,
we present efficient novel algorithms to compute the RoM. The crucial technique
is a subroutine that achieves the remarkable features in calculation of
overlaps between pure stabilizer states: (i) the time complexity per each
stabilizer is reduced exponentially, (ii) the space complexity is reduced
superexponentially. Based on this subroutine, we present algorithms to compute
the RoM for arbitrary states up to $n=7$ qubits on a laptop, while brute-force
methods require a memory size of 86 TiB. As a byproduct, the proposed
subroutine allows us to simulate the stabilizer fidelity up to $n=8$ qubits,
for which naive methods require memory size of 86 PiB so that any
state-of-the-art classical computer cannot execute the computation. We further
propose novel algorithms that utilize the preknowledge on the structure of
target quantum state such as the permutation symmetry of disentanglement, and
numerically demonstrate our state-of-the-art results for copies of magic states
and partially disentangled quantum states. The series of algorithms constitute
a comprehensive ``handbook'' to scale up the computation of the RoM, and we
envision that the proposed technique applies to the computation of other
quantum resource measures as well.
Related papers
- T-Count Optimizing Genetic Algorithm for Quantum State Preparation [0.05999777817331316]
We present and utilize a genetic algorithm for state preparation circuits consisting of gates from the Clifford + T gate set.
Our algorithm does automatically generate fault tolerantly implementable solutions where the number of the most error prone components is reduced.
arXiv Detail & Related papers (2024-06-06T12:26:14Z) - Fault Tolerant Non-Clifford State Preparation for Arbitrary Rotations [3.47670594338385]
We propose a postselection-based algorithm to efficiently prepare resource states for gate teleportation.
Our algorithm achieves fault tolerance, demonstrating the exponential suppression of logical errors with code distance.
Our approach presents a promising path to reducing the resource requirement for quantum algorithms on error-corrected and noisy intermediate-scale quantum computers.
arXiv Detail & Related papers (2023-03-30T13:46:52Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
We design, implement, and evaluate three hybrid quantum k-Means algorithms.
We exploit quantum phenomena to speed up the computation of distances.
We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
arXiv Detail & Related papers (2022-12-13T16:04:16Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - The vacuum provides quantum advantage to otherwise simulatable
architectures [49.1574468325115]
We consider a computational model composed of ideal Gottesman-Kitaev-Preskill stabilizer states.
We provide an algorithm to calculate the probability density function of the measurement outcomes.
arXiv Detail & Related papers (2022-05-19T18:03:17Z) - 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) - Quantum algorithm for stochastic optimal stopping problems with
applications in finance [60.54699116238087]
The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory.
We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
arXiv Detail & Related papers (2021-11-30T12:21:41Z) - Quantum algorithms for approximate function loading [0.0]
We introduce two approximate quantum-state preparation methods for the NISQ era inspired by the Grover-Rudolph algorithm.
A variational algorithm capable of loading functions beyond the aforementioned smoothness conditions is proposed.
arXiv Detail & Related papers (2021-11-15T17:36:13Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - Efficient State Preparation for Quantum Amplitude Estimation [0.951828574518325]
Quantum Amplitude Estimation can achieve a quadratic speed-up for applications classically solved by Monte Carlo simulation.
Currently known efficient techniques require problems based on log-concave probability distributions, involve learning an unknown distribution from empirical data, or fully rely on quantum arithmetic.
We introduce an approach to simplify state preparation, together with a circuit optimization technique, both of which can help reduce the circuit complexity for QAE state preparation significantly.
arXiv Detail & Related papers (2020-05-15T18:00:01Z)
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.