Quantum Data Transfer Speeds up Using Multiple Continuous Signals

Researchers at North Carolina State University, led by Joel Bierman, have investigated a novel method for efficiently transferring quantum information between qubits, the fundamental units of quantum computation, and continuous-variable quantum systems known as qumodes. These qumodes represent quantum information using continuous degrees of freedom, such as the amplitude and phase of light, offering a different approach to quantum processing compared to discrete qubits. Distributing an initial multi-qubit state across multiple qumodes sharply reduces the time required for information transfer, improving from exponential scaling to $\mathcal{O}(2^{n/m})$. The multi-qumode transfer accelerates the quantum Fourier transform, a key operation in many quantum algorithms. Enabling scalable conversion between discrete and continuous quantum information, this advances the field of mixed analogue-digital quantum signal processing with potential applications in computing, sensing, and communication.

Multi-qumode architectures enable exponential speedup in quantum state transfer and Fourier transforms

The runtime for transferring an n-qubit state has dramatically improved, shifting from O(2 n ) with a single qumode to O(2 n/m ) utilising m qumodes. This represents a fundamental shift in scalability for quantum information transfer. Previously, exponential limitations imposed by qubit number rendered complex quantum computations impractical, as the resources required grew exponentially with the number of qubits. The core principle behind this improvement lies in parallelisation; by distributing the quantum state across multiple qumodes, the computational workload is divided, leading to a reduction in the overall transfer time. This is analogous to transferring a large file across multiple network connections rather than a single one. The initial work demonstrated transfer to a single qumode, but this new research highlights the benefits of expanding to m qumodes, where m is an integer representing the number of qumodes employed. Distributing the quantum state across multiple qumodes now unlocks the potential for larger, more intricate quantum systems, paving the way for more complex quantum algorithms and simulations.

This multi-qumode approach not only accelerates state transfer but also provides a pathway to realising the n-qubit quantum Fourier transform on m qumodes, scaling at O(m 2 n/m/ε + m 2 ), a significant advancement for quantum algorithms. The quantum Fourier transform (QFT) is a crucial component in many quantum algorithms, including Shor’s algorithm for factoring large numbers and quantum phase estimation. Its efficient implementation is therefore paramount for achieving quantum advantage. The scaling of O(m 2 n/m/ε + m 2 ) indicates that the computational cost of the QFT grows more slowly with the number of qubits n as the number of qumodes m increases, up to a certain point. Fidelity of this multi-qumode state transfer is bounded by 1−O(nε)− me −O(∆ 2 /σ 2 ) , where ε represents the error per quantum signal processing circuit, ∆ represents the deviation of the initial state from the ideal state, and σ represents the standard deviation of the qumode’s Gaussian state. This fidelity bound highlights the trade-offs involved in achieving high-accuracy state transfer. The total gate depth required for this process is O(2 n/m ), indicating a practical reduction in computational complexity. Gate depth is a measure of the number of quantum operations required to perform a calculation, and a lower gate depth generally translates to a faster and more reliable computation. Current calculations assume a noise-free state transfer process, though achieving this fidelity in a real-world implementation remains a significant challenge. Maintaining high fidelity during state transfer requires minimising error accumulation within the quantum signal processing circuits, and necessitates careful calibration and control of the quantum system. Error correction techniques may also be required to mitigate the effects of noise and decoherence.

Accelerating quantum Fourier transforms via scalable qubit-qumode conversion

A new era of quantum computation is being built by tackling the challenge of seamlessly integrating different quantum systems. Converting information between qubits and qumodes, with their continuous variables, promises to unlock more powerful and flexible algorithms. Qubits excel at discrete calculations, while qumodes are well-suited for analogue signal processing. Combining these strengths allows for the development of hybrid quantum algorithms that can leverage the advantages of both approaches. The demonstrated quantum Fourier transform is currently an approximation, introducing a trade-off between accuracy and computational speed governed by the epsilon parameter. This parameter represents the acceptable level of error in the approximation, and adjusting it allows for a balance between speed and accuracy. A smaller epsilon value leads to higher accuracy but also requires more computational resources. Distributing the workload across multiple qumodes demonstrably accelerates calculations, reducing the time needed to process quantum information. This acceleration is particularly beneficial for tasks that require repeated application of the quantum Fourier transform, such as quantum simulation and optimisation problems.

This scalable method of converting between discrete qubits and continuous qumodes is a key step towards more complex and powerful quantum computers, applicable to fields like sensing and secure communication. In quantum sensing, qumodes can be used to enhance the precision of measurements, while in secure communication, they can enable the development of more robust quantum key distribution protocols. Realising complex quantum operations, such as the quantum Fourier transform, is now possible using a hybrid digital-analogue system. This opens up new possibilities for designing quantum algorithms that are tailored to the strengths of both qubit-based and qumode-based quantum processing. A foundation is established for future investigations into optimising fidelity and exploring practical applications in areas like quantum sensing and communications. Further research will focus on improving the robustness of the state transfer process, reducing the impact of noise and decoherence, and developing more efficient quantum algorithms that can leverage the unique capabilities of multi-qumode architectures. The development of suitable hardware platforms for implementing these algorithms is also a crucial area of ongoing research.

The researchers successfully demonstrated a method for transferring quantum information from multiple qubits to multiple qumodes, improving processing time to a scaling of $\mathcal{O}(2^{n/m})$. This conversion between discrete and continuous quantum information is important because it enables the approximate realisation of the n-qubit quantum Fourier transform using qumodes with improved runtime. The study shows distributing quantum calculations across multiple qumodes accelerates processing, and the authors intend to focus on improving the robustness of this state transfer and reducing errors. This work represents a step towards mixed analog-digital quantum signal processing for computing, sensing and communication.