Protocol Discovery for the Quantum Control of Majoranas by Differentiable Programming and Natural Evolution Strategies
Luuk Coopmans, Di Luo, Graham Kells, Bryan K. Clark, Juan, Carrasquilla

TL;DR
This paper introduces a machine learning approach combining Differentiable Programming and Natural Evolution Strategies to optimize the control of Majorana zero modes in superconducting nanowires, revealing efficient protocols for quantum computation.
Contribution
It develops a novel optimization framework for quantum control of Majoranas, uncovering a high-fidelity jump-move-jump protocol with robustness against disorder and interactions.
Findings
Discovered a high-fidelity jump-move-jump control protocol.
Validated protocol robustness in realistic nanowire models.
Demonstrated machine learning's effectiveness in quantum many-body control.
Abstract
Quantum control, which refers to the active manipulation of physical systems described by the laws of quantum mechanics, constitutes an essential ingredient for the development of quantum technology. Here we apply Differentiable Programming (DP) and Natural Evolution Strategies (NES) to the optimal transport of Majorana zero modes in superconducting nanowires, a key element to the success of Majorana-based topological quantum computation. We formulate the motion control of Majorana zero modes as an optimization problem for which we propose a new categorization of four different regimes with respect to the critical velocity of the system and the total transport time. In addition to correctly recovering the anticipated smooth protocols in the adiabatic regime, our algorithms uncover efficient but strikingly counter-intuitive motion strategies in the non-adiabatic regime. The emergent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
