Nagoya University Finds Speed-Up in Quantum Communication

A polynomial gap exists between randomised communication and constant-round quantum communication using a total Boolean function developed at Nagoya University, enabling computation previously requiring many exchanges of information. Atsuya Hasegawa and François Le Gall led the research detailing this advancement. Quantum computation now exhibits advantage with remarkably few communication steps between parties involved. Establishing superiority formerly required numerous exchanges of information, but this new work achieves it within a constant number of rounds, meaning the amount of back-and-forth does not increase as the problem grows more complex.

This breakthrough concerns total functions, computations which yield an answer for every possible input combination, making the result broadly applicable to various computational tasks. The researchers achieved a key advance in quantum communication demonstrating a computation where quantum methods outperform traditional approaches using minimal back-and-forth exchange of information. Previously establishing this advantage needed numerous rounds of communication between parties; however, this new work achieves it within a constant number of exchanges and the amount of data transferred doesn’t increase as problems become more complex.

These findings apply to total functions, understood like a reliable recipe: given any valid input ingredients, they always produce an output result. The team built upon existing research involving ‘query complexity’, and used techniques similar to sending messages through a special encrypted channel only once or twice. The implications raise questions about the potential for drastically faster quantum algorithms, with further details outlining the specific construction and proof following shortly.

Four-Round Quantum Protocol Exhibits Polynomial Communication Complexity Gap

A power separation of 5/4, 1/(4t), now surpasses previous quantum protocols that required polynomially many rounds to achieve similar results, with t equal to one yielding a four-round protocol. This breakthrough establishes the existence of a total Boolean function exhibiting a polynomial gap between randomised communication complexity and constant-round quantum communication complexity, something previously unattainable without numerous interaction rounds. The method constructed this advantage by composing functions and utilising existing partial functions alongside mathematical structures termed ‘and/or trees’ and ‘inner-product gadgets’.

It effectively amplified computational differences; analysis revealed the resulting protocol requires only four rounds of interaction under optimal conditions (when t equals one). This represents a major reduction in interactions compared with earlier designs needing considerably more steps.

Function composition via and/or trees and inner products for constant round complexity

The technique centred around function composition, which amplified computational differences, building upon an established partial function known as Fn, previously used in related work offering quantum advantages over randomised classical approaches. The team combined an ‘and/or tree’, a mathematical rule that reliably produces output given any valid input, with this initial function. It then integrated ‘inner-product gadgets’, effectively creating a complex total query function called Gn. Researchers leveraged previous results establishing a quantum benefit when processing information using these functions and structures to enhance those existing advantages.

Quantum supremacy demonstrated for a single universally solvable function

The researchers have identified a computational function where quantum communication demonstrably outperforms classical methods, even with limited interactions. This finding establishes an important theoretical advantage but currently applies only to one specific total function, a computation providing an answer for every valid input. The result is unclear whether this result is isolated or indicates broader potential within other functions; the prevalence of such advantageous computations in practice requires further investigation. Nevertheless, it definitively proves that quantum communication can outperform classical methods in principle and demonstrates inherent benefits in information processing without requiring increasing volumes of exchanged data.

The research demonstrated that a particular total function, created using ‘and/or trees’ and ‘inner-product gadgets’, allows quantum communication to surpass randomised classical approaches with just four rounds of interaction. This means a computational benefit exists even when limiting the amount of back-and-forth exchange between parties. The team showed this advantage for one specific function, Gn, building on previous work with the Fn partial function. Researchers acknowledge further investigation is needed to determine if similar advantages exist across other computations.