Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
88 tokens/sec
Gemini 2.5 Pro Premium
46 tokens/sec
GPT-5 Medium
16 tokens/sec
GPT-5 High Premium
17 tokens/sec
GPT-4o
95 tokens/sec
DeepSeek R1 via Azure Premium
90 tokens/sec
GPT OSS 120B via Groq Premium
461 tokens/sec
Kimi K2 via Groq Premium
212 tokens/sec
2000 character limit reached

Fidelity-based distance bounds for $N$-qubit approximate quantum error correction (2212.04368v2)

Published 8 Dec 2022 in quant-ph

Abstract: The Eastin-Knill theorem is a central result of quantum error correction theory and states that a quantum code cannot correct errors exactly, possess continuous symmetries, and implement a universal set of gates transversely. As a way to circumvent this result, there are several approaches in which one gives up on either exact error correction or continuous symmetries. In this context, it is common to employ a complementary measure of fidelity as a way to quantify quantum state distinguishability and benchmark approximations in error correction. Despite having useful properties, evaluating fidelity measures stands as a challenging task for quantum states with a large number of entangled qubits. With that in mind, we address two distance measures based on the sub- and superfidelities as a way to bound error approximations, which in turn require a lower computational cost. We model the lack of exact error correction to be equivalent to the action of a single dephasing channel, evaluate the proposed fidelity-based distances both analytically and numerically, and obtain a closed-form expression for a general $N$-qubit quantum state. We illustrate our bounds with two paradigmatic examples, an $N$-qubit mixed GHZ state and an $N$-qubit mixed $W$ state.

Citations (1)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.