In the context of quantum computing, Fidelity is a score (ranging from 0 to 1, or 0% to 100%) that measures how "close" a real-world quantum state or operation is to the perfect, ideal theoretical version.
Think of it like an accuracy score for a musician playing a song. If they play every note perfectly, the fidelity is 1 (100%).
Here is the breakdown of the two main types: State Fidelity and Gate Fidelity.
1. State Fidelity (The "Snapshot" Score)
State fidelity measures the accuracy of the quantum information stored in a qubit at a specific moment in time.
Ideal:
5 $F = 1$ (The states are identical).6 Worst Case:
7 $F = 0$ (The states are completely opposite/orthogonal).8
The Formula
For two pure quantum states, the target state 9$|\psi\rangle$ and the actual state 10$|\phi\rangle$, the fidelity is the squared overlap between them:11
Example
Imagine you want to prepare a qubit in the "Up" state ($|0\rangle$).
Ideal Scenario: Your hardware works perfectly. The actual state is $|0\rangle$.
Calculation: $F = |\langle 0 | 0 \rangle|^2 = 1^2 = 1$. (100% Fidelity).
Real Scenario (Noise): Due to heat or magnetic interference, the qubit tilts slightly.
12 Instead of pointing straight up, it is tilted by a small angle $\theta$. The actual state is slightly mixed with $|1\rangle$.If the overlap is $0.99$, your fidelity is $0.99^2 \approx 0.98$.
This means your qubit is "98% accurate" relative to the target.
2. Gate Fidelity (The "Action" Score)
Gate fidelity is more complex; it measures the accuracy of an operation (like a logical gate) rather than just a static state.
Because a gate acts on any input state, Gate Fidelity is essentially the average state fidelity over all possible input states.
High Gate Fidelity (>99%): The gate is reliable and introduces very little noise.
14 Low Gate Fidelity (<90%): The gate is "noisy" and essentially garbles the data.
The Concept
If you have a NOT gate (X-gate) that is supposed to flip $|0\rangle$ to $|1\rangle$:
Perfect Gate: Always turns $|0\rangle \rightarrow |1\rangle$ and $|1\rangle \rightarrow |0\rangle$ exactly. $F_{gate} = 1$.
15 Noisy Gate: Sometimes it over-rotates or under-rotates. Maybe it turns $|0\rangle$ into $99.9\% \ |1\rangle$ and $0.1\% \ |0\rangle$.
Example: The "Three Nines" Standard
In the industry, you often hear about "two nines" (99%) or "three nines" (99.9%) gate fidelity.
99.9% Fidelity: This implies that, on average, the gate operation will fail or introduce a fatal error only 1 time out of 1000 executions.
Why this matters: If you run an algorithm with 1,000 gates (which is a small algorithm), and each gate has 99.9% fidelity, your total chance of success is roughly $0.999^{1000} \approx 36\%$. If the fidelity drops to 99%, your success rate plummets to $0.99^{1000} \approx 0.004\%$. This illustrates why high gate fidelity is absolutely critical for running useful algorithms.
Summary Comparison table
| Feature | State Fidelity | Gate Fidelity |
| What it measures | Accuracy of a qubit's current status (Static). | Accuracy of an operation performed on a qubit (Dynamic). |
| Analogy | Is the car parked exactly in the spot? | Does the steering wheel turn the car exactly 90°? |
| Key Use Case | Checking memory storage (coherence). | Checking processor performance (logic gates). |
| Mathematical Basis | Overlap (Inner Product). | Average overlap over all inputs. |
Why is this important?
Quantum Error Correction (QEC) requires a specific threshold of gate fidelity to work.
No comments:
Post a Comment
Note: only a member of this blog may post a comment.