Rapid development of quantum computing technology has led to a wide variety of sophisticated quantum devices. Benchmarking these systems becomes crucial for understanding their capabilities and paving the way for future advancements. The Quantum Volume (QV) test is one of the most widely used benchmarks for evaluating quantum computer performance due to its architecture independence. However, as the number of qubits in a quantum device grows, the test faces a significant limitation. It requires determining the subspace of the most probable outcomes, a task that is typically performed via classical simulation of the quantum circuit and therefore incurs an exponential computational cost. In this work, we propose modifications to the QV test, by adopting a carefully restricted circuit ensemble generated from a gate set that remains universal for quantum computation, that allow for the direct determination of the heavy-output subspace. Crucially, the modified circuits remain capable of general quantum computation. This approach overcomes the scalability barrier of the QV test beyond classical computational limits, while still probing the key features of universal quantum computing.

Close

PrevNext

View figure in article

• Quantum algorithms
• Quantum benchmarking
• Quantum circuits
• Quantum engineering