Searcharxiv⌕ Search

arXiv subjects

Sergei Leonov

Publications and source records attributed to Sergei Leonov.

2 recordsLinked to original sources

Time- and Photon-Optimal Paths for the Preparation and Logical Flip of Gottesman-Kitaev-Preskill States

Gottesman-Kitaev-Preskill (GKP) states are highly non-Gaussian, making their control challenging, particularly in the presence of photon loss. Here, we use the brachistochrone, the fastest path at bounded speed, to construct ideal nonlinear Hamiltonians for state preparation and logical gates, and compare it with the photon-optimal path. We find that the two paths nearly coincide for state preparation but differ markedly for logical operations, namely the brachistochrone preserves the encoded qubit during a bit flip, whereas the photon-optimal path flips a known state through the vacuum. We then introduce the tangential capacity to quantify how effectively gate sets track these paths. Using this analysis, we find that conditional squeezing achieves the highest capacity, preparing GKP states in 824 ns with a fidelity of 0.99 and a minimum closeness to the path of 0.90, compared with 0.98 and 0.51 for conditional displacements and 0.83 and 0.19 for SNAP gates.

quant-ph↗

Two Optimizations on the Stålmarck Procedure

In this paper, we introduce StalmarckSAT, the a modern re-implementation of the Stålmarck Procedure for SAT solving, and present two novel strategies to improve the Procedure, Cardinality Driven Branching (CDB) and Deductive Priority Ordering (DPO). CDB is a heuristic to improve branching with the dilemma rule, and DPO intelligently orders simple rules based on their deductive potential. Our results demonstrate improved solve times with both strategies.

cs.LO↗