7,289 research outputs found
Genetic braid optimization: A heuristic approach to compute quasiparticle braids
In topologically-protected quantum computation, quantum gates can be carried
out by adiabatically braiding two-dimensional quasiparticles, reminiscent of
entangled world lines. Bonesteel et al. [Phys. Rev. Lett. 95, 140503 (2005)],
as well as Leijnse and Flensberg [Phys. Rev. B 86, 104511 (2012)] recently
provided schemes for computing quantum gates from quasiparticle braids.
Mathematically, the problem of executing a gate becomes that of finding a
product of the generators (matrices) in that set that approximates the gate
best, up to an error. To date, efficient methods to compute these gates only
strive to optimize for accuracy. We explore the possibility of using a generic
approach applicable to a variety of braiding problems based on evolutionary
(genetic) algorithms. The method efficiently finds optimal braids while
allowing the user to optimize for the relative utilities of accuracy and/or
length. Furthermore, when optimizing for error only, the method can quickly
produce efficient braids.Comment: 6 pages 4 figure
Physical-depth architectural requirements for generating universal photonic cluster states
Most leading proposals for linear-optical quantum computing (LOQC) use
cluster states, which act as a universal resource for measurement-based
(one-way) quantum computation (MBQC). In ballistic approaches to LOQC, cluster
states are generated passively from small entangled resource states using
so-called fusion operations. Results from percolation theory have previously
been used to argue that universal cluster states can be generated in the
ballistic approach using schemes which exceed the critical threshold for
percolation, but these results consider cluster states with unbounded size.
Here we consider how successful percolation can be maintained using a physical
architecture with fixed physical depth, assuming that the cluster state is
continuously generated and measured, and therefore that only a finite portion
of it is visible at any one point in time. We show that universal LOQC can be
implemented using a constant-size device with modest physical depth, and that
percolation can be exploited using simple pathfinding strategies without the
need for high-complexity algorithms.Comment: 18 pages, 10 figure
- …