Quantum Volume

What Is Quantum Volume?

Quantum Volume (QV) measures the effective computational power of a quantum computer, accounting for qubit count, gate fidelity, connectivity, and circuit depth:

where is the depth of the largest random circuit solved with >2/3 success probability using qubits.

QV Measurement Protocol

1. Select qubits from the device
2. Generate random circuits of depth
3. Sample outputs and compute heavy output probability (HOP)
4. Accept if HOP > 2/3 with 97% confidence

For random circuits, ideal HOP .

Interleaved Randomized Benchmarking

Interleaved RB characterizes two-qubit gate fidelity:

1. Generate random Clifford sequences of length
2. Interleave the target gate between random Cliffords
3. Measure survival probability:
4. Extract error rate:

Current state-of-the-art: for superconducting qubits.

Other Benchmarking Metrics

CLOPS: Circuit Layer Operations Per Second RCS: Random Circuit Sampling (Google's benchmark) Algorithmic benchmarks: VQE, QAOA performance on specific instances

No single metric captures all aspects of quantum computer performance.

QV Progress

QV has grown roughly exponentially, following a quantum Moore's law trajectory.

Limitations of QV

1. Only tests random circuits, not structured algorithms
2. Does not account for measurement errors
3. Requires exponential classical resources for large
4. Ignores software stack efficiency

Alternatives: algorithmic benchmarks, EPLG, cross-entropy benchmarking.

Python: QV Simulation

import numpy as np

def simulate_qv_circuit(n, depth, noise_rate):
    fidelity = 1.0
    for layer in range(depth):
        fidelity *= (1 - noise_rate * n)
    hop_ideal = 0.85
    return hop_ideal * fidelity + (1 - fidelity) * 0.5

n = 5
noise_rate = 0.01
max_depth = 0
for d in range(1, 100):
    if simulate_qv_circuit(n, d, noise_rate) > 2/3:
        max_depth = d
    else:
        break
print(f"Estimated QV = 2^{max_depth} = {2**max_depth}")

Random Circuit Sampling Theory

The output distribution of a random circuit:

For a truly random unitary, follows the Porter-Thomas distribution:

where . The cross-entropy benchmarking fidelity measures how close the experimental distribution is to the ideal:

Quantum Advantage Timeline

Summary

This topic covers the fundamental concepts and applications in quantum computing. Understanding these concepts is essential for advancing in the field and applying quantum techniques to real-world problems. The mathematical framework provides the foundation for analyzing quantum algorithms and hardware implementations.

Key takeaways include the importance of quantum coherence, the role of entanglement as a resource, and the tradeoffs between different quantum computing architectures. As the field progresses from NISQ to fault-tolerant devices, these foundational concepts will continue to underpin new developments and applications.

Further study should include hands-on implementation using quantum programming frameworks, analysis of recent research papers, and exploration of the connections between quantum computing and other fields such as machine learning, optimization, and simulation.