Disentangling quantum algorithms using symmetry

Quantum entanglement is a natural phenomenon in quantum mechanics that has enormous significance in quantum information science, including quantum computing. It enters quantum states in algorithms through the application of multi-qubit quantum logic operations such as the CNOT and Ising gates. While deliberate entanglement adds power and efficiency to algorithms, unintentional entanglement can be undesirable for a variety of reasons. Unintentional entanglement adds complexity, often making the outcome of a given algorithm more difficult to understand, and potentially more sensitive to errors. Furthermore, it can be an indication that an algorithm has not been optimized. If we could transfer entanglement from our algorithms into the bases that define our systems, then we could potentially reduce our algorithms. Such algorithm reductions will be of outmost importance for resource-limited, noisy intermediate-scale quantum (NISQ) computers.

In this presentation, we will demonstrate how such a reduction could be achieved in a small quantum system using symmetry. In addition to reducing the needed resources, our quantum computer calculations show a significant improvement in accuracy.