Experimental Superposition of Orders of Quantum Gates

Abstract: In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it has recently been theoretically predicted that superimposing quantum circuits, each with a different gate order, could provide quantum computers with an even further computational advantage [3-5]. Here, we experimentally demonstrate this enhancement by applying two quantum gates in a superposition of both possible orders to determine whether the two gates commute or anti-commute. We are able to make this determination with only a single use (or query) of each gate, while all quantum circuits with a fixed order of gates would require at least two uses of one of the gates [3]. Remarkably, when the problem is scaled to N gates, creating a superposition of quantum circuits is likely to provide an exponential advantage over classical algorithms, and a linear advantage over quantum algorithms with fixed gate order [4]. The new resource that we exploit in our experiment can be interpreted as a "superposition of causal orders". We demonstrate such a superposition could allow some quantum algorithms to be implemented with an efficiency that is unlikely to be achieved on a quantum computer with a fixed gate order.

• The paper introduces an experimental method that superposes quantum gate orders, enabling single-query determination of gate commutation.
• The experimental approach, using single-photon interferometry, achieved a success rate of approximately 97.6% compared to 92.88% with fixed-order circuits.
• This advancement offers a new resource for quantum algorithm design by reducing query complexity and paving the way for scalable quantum computing.

Superposition of Quantum Gates: Experimental Realization and Computational Implications

The paper "Experimental Superposition of Orders of Quantum Gates" explores a novel advancement in the domain of quantum computing, focusing on an experimental method that leverages the superposition of quantum logical gates to potentially enhance computational efficiency. Authored by Lorenzo M. Procopio et al., this research introduces and demonstrates a foundational concept extending beyond the traditional quantum circuit model, namely the "superposition of causal orders."

Overview of Experimental Approach

Quantum computational power is traditionally explored in terms of state superposition. However, this paper extends the notion to quantum circuits themselves, suggesting that gate order—a fundamental aspect of circuit design—can exist in a superposition. By experimentally implementing the 2-SWITCH operation, the researchers explored whether different orders of quantum gates can be superimposed, allowing for the tasks to be completed more efficiently than in a circuit with a fixed gate order. This is particularly exemplified in determining whether two quantum gates commute or anti-commute. The authors emphasize that traditional fixed-order circuits require multiple queries to accomplish this, while their proposed superposition model achieves the same result with only a single query for each gate.

Key Results and Numerical Findings

The experiments utilize an optical setup with single-photon interferometry to test unitary gate configurations, demonstrating a notable success rate in determining gate commutation properties. The results show an average success rate exceeding that of the optimal fixed-order circuits, specifically achieving a success probability of approximately 0.976 compared to the maximum of 0.9288 achievable with fixed order, thus providing empirical evidence that the model offers an advantage over traditional methods.

Implications and Theoretical Significance

The work not only exhibits practical computational advantages over fixed-order systems but also poses significant theoretical implications. The notion of superposing causal orders introduces a paradigm shift, revealing a new resource for quantum algorithm design, particularly for tasks reducible in query complexity. From a foundational viewpoint, the experiment aligns with the concept of indefinite causal structures, adding a layer of complexity to our understanding of quantum operations and temporal sequence.

Prospects and Future Directions

The success of this experiment opens pathways for exploring quantum algorithms that exploit similar superpositional and causal order advantages. The potential exponential gains in query complexity for larger-scale implementations imply relevance in quantum machine learning, cryptography, and complex system simulations. Future research may focus on extending this principle to multi-gate systems, expanding the scope of operations beyond binary gate interactions.

The research integrated different physical implementations, indicating potential for scalability and adaptation across various quantum computing architectures, such as trapped ions and superconducting qubits, contingent on further technological advancements. As the community progresses, harnessing such quantum-advantaged operations could transform computational landscapes and broaden the applicability of quantum computers.

This paper certainly adds a new dimension to quantum computation, encouraging a re-evaluation of how quantum circuits are structured and potentially paving the way for more sophisticated processing techniques that fundamentally leverage the principles of quantum mechanics.