arXiv subjects

Krishanu Sankar

Publications and source records attributed to Krishanu Sankar.

6 recordsLinked to original sources

arXiv2024

Spatially parallel decoding for multi-qubit lattice surgery

Running quantum algorithms protected by quantum error correction requires a real time, classical decoder. To prevent the accumulation of a backlog, this decoder must process syndromes from the quantum device at a faster rate than they are generated. Most prior work on real time decoding has focused on an isolated logical qubit encoded in the surface code. However, for surface code, quantum programs of utility will require multi-qubit interactions performed via lattice surgery. A large merged patch can arise during lattice surgery -- possibly as large as the entire device. This puts a significant strain on a real time decoder, which must decode errors on this merged patch and maintain the level of fault-tolerance that it achieves on isolated logical qubits. These requirements are relaxed by using spatially parallel decoding, which can be accomplished by dividing the physical qubits on the device into multiple overlapping groups and assigning a decoder module to each. We refer to this approach as spatially parallel windows. While previous work has explored similar ideas, none have addressed system-specific considerations pertinent to the task or the constraints from using hardware accelerators. In this work, we demonstrate how to configure spatially parallel windows, so that the scheme (1) is compatible with hardware accelerators, (2) supports general lattice surgery operations, (3) maintains the fidelity of the logical qubits, and (4) meets the throughput requirement for real time decoding. Furthermore, our results reveal the importance of optimally choosing the buffer width to achieve a balance between accuracy and throughput -- a decision that should be influenced by the device's physical noise.

quant-ph↗

arXiv2021

A Benchmarking Study of Quantum Algorithms for Combinatorial Optimization

We study the performance scaling of three quantum algorithms for combinatorial optimization: measurement-feedback coherent Ising machines (MFB-CIM), discrete adiabatic quantum computation (DAQC), and the D\"urr-Hoyer algorithm for quantum minimum finding (DH-QMF) that is based on Grover's search. We use MaxCut problems as a reference for comparison, and time-to-solution (TTS) as a practical measure of performance for these optimization algorithms. For each algorithm, we analyze its performance in solving two types of MaxCut problems: weighted graph instances with randomly generated edge weights attaining 21 equidistant values from $-1$ to $1$; and randomly generated Sherrington-Kirkpatrick (SK) spin glass instances. We empirically find a significant performance advantage for the studied MFB-CIM in comparison to the other two algorithms. We empirically observe a sub-exponential scaling for the median TTS for the MFB-CIM, in comparison to the almost exponential scaling for DAQC and the proven $\widetilde{O}\left(\sqrt{2^n}\right)$ scaling for DH-QMF. We conclude that the MFB-CIM outperforms DAQC and DH-QMF in solving MaxCut problems.

quant-ph↗

arXiv2021

On the $C_p$-equivariant dual Steenrod algebra

We compute the $C_p$-equivariant dual Steenrod algebras associated to the constant Mackey functors $\underline{\mathbb{F}}_p$ and $\underline{\mathbb{Z}}_{(p)}$, as $\underline{\mathbb{Z}}_{(p)}$-modules. The $C_p$-spectrum $\underline{\mathbb{F}}_p \otimes \underline{\mathbb{F}}_p$ is not a direct sum of $RO(C_p)$-graded suspensions of $\underline{\mathbb{F}}_p$ when $p$ is odd, in contrast with the classical and $C_2$-equivariant dual Steenrod algebras.

math.AT↗

arXiv2019

Symmetric Powers and Eilenberg--Maclane Spectra

We filter the equivariant Eilenberg Maclane spectrum $H\underline{\mathbb{F}}_p$ using the mod $p$ symmetric powers of the equivariant sphere spectrum, $\mathrm{Sp}_{\mathbb{Z}/p}^{\infty}(\Sigma^{\infty G}S^0)$. When $G$ is a $p$-group, we show that the layers in the filtration are the Steinberg summands of the equivariant classifying spaces of $(\mathbb{Z}/p)^n$ for $n=0, 1, 2, \ldots$. We show that the layers of the filtration split after smashing with $H\underline{\mathbb{F}}_p$. Along the way, we produced a general computation of the geometric fixed points of $H\underline{\mathbb{Z}}$ and $H\underline{\mathbb{F}}_p$ by using symmetric powers.

math.AT↗

arXiv2019

Equivariant Steinberg Summands

We construct Steinberg summands of $G$-equivariant spectra with $\mathrm{GL}_n(\mathbb{F}_p)$-action. We prove a lemma about their fixed points when $G$ is a $p$-group, and then use this lemma to compute the fixed points of the Steinberg summand of the equivariant classifying space of $(\mathbb{Z}/p)^n$. These results will be used in a companion paper to study the layers in the mod $p$ symmetric power filtration for $H\underline{\mathbb{F}}_p$.

math.AT↗

arXiv2011

Achievable Sets in Z^n

What sets A \subset Z^n can be written in the form (K-K) \cap Z^n, where K is a compact subset of R^n such that K+Z^n=R^n? Such sets A are called achievable, and it is known that if A is achievable, then < A >=Z^n. This condition completely characterizes achievable sets for n=1, but not much is known for n \ge 2. We attempt to characterize achievable sets further by showing that with any finite, symmetric set A \subset Z^n containing zero, we may associate a graph G(A). Then if A is achievable, we show the set associated to some connected component of G(A) is achievable. In two dimensions, we can strengthen this theorem further. Further generalizations and open questions are discussed. Throughout, the language and formalism of algebraic topology are useful.

math.NT↗