The Blog

66 posts · page 2 of 6

Quantum Speed Limits: A Lower Bound Is Not a Promise

Quantum Speed Limits: A Lower Bound Is Not a Promise

A finite quantum speed limit does not guarantee arrival. An exact NumPy example shows why an equatorial qubit reaches an orthogonal state while a tilt…

Degenerate Errors: Different Faults Can Need the Same Recovery

Degenerate Errors: Different Faults Can Need the Same Recovery

A four-qubit example shows when identical syndromes are harmless and when they hide a logical phase error. Test both cases with the Knill-Laflamme con…

Why Unitary Gates Cannot Purify a Mixed Qubit

Why Unitary Gates Cannot Purify a Mixed Qubit

A Hadamard can create off-diagonal entries without making a qubit purer. Test the spectral invariant in NumPy, then track what a SWAP with a clean anc…

Channel Discrimination: A Bell Pair Can Reveal What One Qubit Cannot

Channel Discrimination: A Bell Pair Can Reveal What One Qubit Cannot

Identify an identity channel or a random-Pauli channel with one use. A single probe tops out at 5/6 success, while a retained Bell reference enables p…

Joint Measurements: When Noisy X and Z Become Compatible

Joint Measurements: When Noisy X and Z Become Compatible

Sharp X and Z cannot share an exact joint measurement, but noisy versions can. Build a four-outcome POVM in NumPy and see why the threshold is 1/sqrt(…

Mixed-State Fidelity: Why Matrix Overlap Is Not Enough

Mixed-State Fidelity: Why Matrix Overlap Is Not Enough

Two identical mixed states can have a matrix overlap below one. Learn squared fidelity, root fidelity, and a NumPy calculation that keeps the distinct…

Quantum Kernels: A Similarity Circuit Is Not a Classifier

Quantum Kernels: A Similarity Circuit Is Not a Classifier

Build a one-qubit fidelity kernel, prove its matrix is positive semidefinite, and use it in a tiny classical learner without mistaking similarity for…

W States: Entanglement That Can Survive Losing a Qubit

W States: Entanglement That Can Survive Losing a Qubit

Discard one qubit from a W state and the other two remain entangled, but not as a perfect Bell pair. Trace out the missing qubit and verify the surviv…

Concentrate One Entangled Pair: A Local Filter with a Success Flag

Concentrate One Entangled Pair: A Local Filter with a Success Flag

Use a local filter to turn a known uneven pure pair into a Bell pair on success. Verify both outcomes in NumPy and see why Bob needs a classical flag.

Approximate QFT: Why Matching Counts Is Not Enough

Approximate QFT: Why Matching Counts Is Not Enough

Dropping small controlled rotations can shorten a quantum Fourier transform. A three-qubit NumPy example shows why identical measurement counts do not…

Quantum Volume: What the Heavy Output Test Actually Measures

Quantum Volume: What the Heavy Output Test Actually Measures

Calculate a heavy-output score in Python, distinguish ideal probabilities from measured samples, and see why one good histogram does not certify Quant…

Fixed-Point Quantum Search: Cube the Failure Without Overshooting

Fixed-Point Quantum Search: Cube the Failure Without Overshooting

The pi/3 search recursion turns failure probability epsilon into epsilon cubed. Test it in NumPy, see why success improves at recursion boundaries, an…