6 citations · 6 across the 6 of their papers we have counts for
6 papers
A Key Exchange Construction using Mihailova Subgroups in Braid groups
Hanling Lin, Yu Han
In this paper, we propose a modified Anshel-Anshel-Goldfeld (AAG) key exchange construction.The algebraic motivation underlying this construction comes from the membership problem…
Optimizing sparse quantum state preparation with measurement and feedforward
Yao-Cheng Lu, Han-Hsuan Lin
Quantum state preparation (QSP) is a key component in many quantum algorithms. In particular, the problem of sparse QSP (SQSP) $\unicode{x2013}$ the task of preparing the states wi…
Getting almost all the bits from a quantum random access code
Han-Hsuan Lin, Ronald de Wolf
A quantum random access code (QRAC) is a map that encodes -bit strings into -qubit quantum states , in a way that allows us to recover any one bit of $…
D-commuting SYK model: building quantum chaos from integrable blocks
Ping Gao, Han Lin, Cheng Peng
We construct a new family of quantum chaotic models by combining multiple copies of integrable commuting SYK models. As each copy of the commuting SYK model does not commute with o…
Near-Optimal Quantum Algorithm for Finding the Longest Common Substring between Run-Length Encoded Strings
Tzu-Ching Lee, Han-Hsuan Lin
We give a near-optimal quantum algorithm for the longest common substring (LCS) problem between two run-length encoded (RLE) strings, with the assumption that the prefix-sums of th…
A sublinear time quantum algorithm for longest common substring problem between run-length encoded strings
Tzu-Ching Lee, Han-Hsuan Lin
We give a sublinear quantum algorithm for the longest common substring (LCS) problem on the run-length encoded (RLE) inputs, under the assumption that the prefix-sums of the runs a…