Researchers from ParityQC have demonstrated a 52-qubit quantum Fourier transform (QFT) on an IBM Quantum Heron r3 processor, establishing a new performance benchmark and representing the largest such circuit reported to date. Scaling QFTs is notoriously difficult due to the challenges of maintaining performance as qubit count increases; however, ParityQC employed a parity-based circuit construction method to eliminate the need for explicit qubit routing. “It’s not about the qubit count,” said ParityQC co-founder and co-CEO Wolfgang Lechner, noting that the new work nearly doubles a previous QFT benchmark set on trapped-ion hardware. “With our method, we were actually able to reduce the errors and still achieve this doubling.” This achievement highlights how algorithmic improvements and advances in hardware can combine to boost performance on current quantum systems, potentially enabling more efficient implementations of complex algorithms in fields like optimization and quantum chemistry.
Qubit Quantum Fourier Transform Achieved on IBM Heron Processor
This achievement isn’t simply about scaling up qubit numbers; it highlights a crucial interplay between algorithmic innovation and hardware capabilities, specifically leveraging the IBM Quantum Heron r3 processor. ParityQC addressed these challenges with a novel approach that fundamentally alters how quantum information is represented and propagated. Traditionally, superconducting quantum processors rely on SWAP operations to facilitate interactions between non-adjacent qubits, a process that introduces overhead and amplifies errors. “Previously, it was like you did the swapping, which is the logistics, and then the algorithm,” explained ParityQC co-founder and co-CEO Wolfgang Lechner, articulating the team’s core innovation. Instead of tracking individual qubit states, the method focuses on parity information, the relationships between qubits, allowing for the elimination of SWAP gates and a reduction in both gate count and circuit depth. This method effectively merges the logistical aspects of routing with the algorithmic computation itself.
The team’s approach doesn’t merely optimize existing techniques; it rethinks the underlying architecture. Lechner stated that the parity method allows information to become delocalized, flowing through overlapping pathways that simultaneously perform computations and propagate correlations. This shift reduces complex multi-qubit interactions to simpler, single-qubit operations in some cases. The demonstration on the IBM Quantum Heron r3 processor is particularly noteworthy, as the researchers found it to be the best hardware currently available, according to Lechner. They measured process fidelity, a metric capturing the combined effects of circuit depth, noise, and compilation, to compare performance across different quantum platforms, emphasizing the importance of standardized benchmarks. Lechner added, “Even if you think about addition—adding two numbers—if you do this on a quantum computer, it’s based on QFT.”
Parity Twine Method Eliminates SWAP-Based Routing Overhead
The pursuit of scalable quantum computation currently hinges on overcoming limitations in how quantum information is physically routed across processors. This demonstration surpasses previous QFT benchmarks, nearly doubling a previous implementation achieved on trapped-ion hardware. By transferring parity information along physical qubits using CNOT gates, the method effectively reduces the need for explicit SWAP gates, thereby decreasing gate count and circuit depth. This conceptual shift has a tangible impact on the complexity of quantum operations. In conventional circuits, interactions between qubits require operations on both, but with the parity method, “an interaction between two qubits becomes a single-qubit operation,” Lechner stated. The team’s approach not only achieved a near-doubling of the previous QFT benchmark but also reduced errors in the process, suggesting that algorithmic improvements can effectively mitigate the challenges of scaling up qubit counts.
It’s not about the qubit count,” said ParityQC co-founder and co-CEO Wolfgang Lechner, who noted that the new work nearly doubles a previous QFT benchmark set in on trapped-ion hardware.
Process Fidelity Benchmarks Demonstrate Algorithm Performance Gains
ParityQC is pushing the boundaries of quantum circuit performance by fundamentally altering how quantum information is processed, rather than simply adding qubits. This wasn’t merely a scaling exercise, but a demonstration that algorithmic innovation can mitigate the challenges inherent in building larger quantum systems. The difficulty in scaling QFTs stems from the increasing overhead of routing quantum information across the processor, which adds circuit depth and amplifies accumulated noise. ParityQC bypassed this issue with a novel approach that moves away from tracking individual qubit states, focusing instead on tracking relationships between qubits, parity information, and transferring that information using fewer, simpler gate operations. Lechner explains the importance of this benchmark, stating that by comparing their results against those generated by the Qiskit transpiler, the team demonstrated improved performance, particularly as the system size increased, highlighting the potential for this method to unlock more efficient quantum computations. “Even if you think about addition—adding two numbers—if you do this on a quantum computer, it’s based on QFT,” Lechner added, underscoring the QFT’s versatility and importance as a foundational benchmark.
Even if you think about addition-adding two numbers-if you do this on a quantum computer, it’s based on QFT,” Lechner said.
Quantum Fourier Transform as a Versatile Computational Benchmark
This achievement isn’t simply about increasing qubit count, but about fundamentally improving how quantum algorithms are constructed and executed on existing hardware, a critical step toward realizing practical quantum applications. The QFT’s importance stems from its role as a foundational element in numerous quantum algorithms, including Shor’s algorithm for factoring large numbers and quantum phase estimation, which is vital for characterizing quantum systems. Consequently, the QFT serves as a crucial benchmark for assessing the performance of quantum hardware, allowing researchers to compare different platforms, superconducting qubits, trapped ions, or atoms, using a standardized test. “It’s an important benchmark because it is a building block for many other algorithms,” Lechner stated, “and I would go so far to say that it should be a standard component of a quantum device.” Traditional implementations of the QFT on superconducting processors face challenges related to qubit connectivity and routing. “In our case, we are able to merge these two things.” This merging of computation and routing streamlines the process, reducing gate count and circuit depth, and ultimately improving the fidelity of the QFT.
With our method, we were actually able to reduce the errors and still get this doubling.
