Quantum Computers Need 25% Fewer Connections with This New Method

Alex May of the Institute for Quantum Computing and Department of Combinatorics & Optimization at the Perimeter Institute for Theoretical Physics has established definitive limits on entanglement cost in non-local quantum computation are now established. A thorough review of the field defines both upper and lower bounds for the entanglement needed to perform operations without direct interaction. Any quantum channel requires no more than 2αn qubits of entanglement, while some channels need at least βn qubits, refining previous understandings of this key resource.

Precise limits on the entanglement required for non-local quantum computation, a method of performing operations on quantum systems without direct interaction, are now defined. Any quantum channel needs no more than 2αn qubits of entanglement to function, but some demonstrably require at least βn qubits, clarifying the amount of a key quantum resource needed for these computations. This is achieved by using shared entanglement and a single round of quantum communication, effectively separating the systems during computation; imagine sending instructions via a pre-shared secret code than a direct phone call.

Any quantum channel requires no more than 2αn qubits of entanglement, and some channels necessitate at least βn qubits to function. These findings clarify the vital quantum resources needed for these computations and their limitations. The following sections detail the rigorous mathematical framework underpinning these discoveries and explore their implications for various quantum technologies.

Replicating Quantum Channels via Port-teleportation and Non-local Computation

Port-teleportation underpinned much of this work, a technique allowing quantum information to be transferred between distant locations without physically moving the quantum system itself. It relies on a pre-shared entangled pair and classical communication to ‘reconstruct’ the original quantum state at the receiving end; in effect, it’s like disassembling an object and sending instructions for its reassembly rather than the object itself. The technique enabled a demonstration that any quantum channel, representing a method of sending quantum information, could be replicated using non-local quantum computation, avoiding the need for direct interaction between qubits.

A systematic analysis of the entanglement requirements for different computational tasks was achieved, establishing both upper and lower limits on the resource needed. The work focused on determining the entanglement cost to replicate any quantum channel using this method, allowing for a more targeted allocation of quantum resources and enabling the design of optimised computational strategies. Building upon prior work identifying partial functions present in quantum models, the research confirms a functional distinction between computational approaches.

Defining maximum entanglement requirements for optimised quantum channel design

Entanglement measures now stand at a refined upper bound of 2αn qubits, a strong improvement over previous indefinite limits on the resource needed for non-local quantum computation. This threshold is vital as it defines the maximum entanglement required for any quantum channel, something previously unknown; prior work lacked definitive limits, hindering the development of efficient quantum protocols. Alongside the demonstration of channels requiring at least βn qubits, establishing this precise upper bound allows for a more targeted allocation of quantum resources and enables the design of optimised computational strategies.

These findings clarify the fundamental constraints governing non-local computation, paving the way for advancements in areas reliant on secure communication and complex quantum simulations. The communication model R∥∗, utilising shared entanglement and simultaneous classical communication, represents the weakest quantum class separable from R2, as demonstrated by scientists. This separation is achieved through a protocol using this approach. Specifically, a transformation of existing protocols, allowing quantum messages, into equivalent R∥∗ protocols is possible when the initial unitary operation has low T-depth, a measure of computational complexity. Theorem 22 establishes this transformation, showing an R∥∗ protocol can be created using O((68(m+a))d) qubits of communication and entanglement, where ‘m’ represents message qubits, ‘a’ ancilla qubits, and ‘d’ the T-depth.

Volumetric and boundary quantum systems exhibit functional equivalence

Quantum computation is increasingly explored as a means to sidestep the limitations of direct interaction between qubits, instead relying on pre-shared entanglement and communication. This approach offers potential advantages for tasks like secure communication and simulating complex systems. The work reveals a functional equivalence between quantum systems operating within a volume and those restricted to its boundary, echoing concepts from theoretical physics like the holographic principle.

This finding suggests a profound connection between non-local quantum computation and the fundamental nature of spacetime, demonstrating that any quantum channel can be replicated using shared entanglement and communication, effectively confining information processing to a lower-dimensional boundary. This echoes the holographic principle, initially proposed in black hole physics, where information is linked to surface area rather than volume. The principle suggests that all the information contained in a volume of space can be represented on its boundary, a concept now mirrored in quantum information theory. Such equivalence has significant implications for the development of more efficient quantum technologies, potentially reducing the physical resources needed for complex computations.

The research demonstrated a functional equivalence between quantum systems operating within a volume and those restricted to its boundary, mirroring concepts from theoretical physics. This finding indicates that quantum channels can be replicated using shared entanglement and communication, potentially streamlining information processing. Specifically, the authors established a protocol achieving this with O((68(m+a))d) qubits, where ‘m’ represents message qubits, ‘a’ ancilla qubits, and ‘d’ the T-depth of the initial operation. This equivalence has implications for the development of more efficient quantum technologies by potentially reducing the resources required for complex computations.