Related papers: Estimation of pure qubits on circles
We use the Kobayashi-Hitchin correspondence for parabolic bundles to reprove the results of Troyanov and Luo-Tian regarding existence and uniqueness of conformal spherical metrics on the Riemann sphere with prescribed cone angles in the…
Dynamics of coded information over Bloch channels is investigated for different values of the channel's parameters. We show that, the suppressing of the travelling coded information over Bloch channel can be increased by decreasing the…
Single electron spins coupled to multiple nuclear spins provide promising multi-qubit registers for quantum sensing and quantum networks. The obtainable level of control is determined by how well the electron spin can be selectively coupled…
We design spin filters for particles with potentially arbitrary spin S (= 1/2, 1, 3/2,....) using a one-dimensional periodic chain of magnetic atoms as a quantum device. Describing the system within a tight-binding formalism we present an…
Identifying the connected components of a graph, apart from being a fundamental problem with countless applications, is a key primitive for many other algorithms. In this paper, we consider this problem in parallel settings. Particularly,…
The edges of a graph are assigned weights and passage times which are assumed to be positive integers. We present a parallel algorithm for finding the shortest path whose total weight is smaller than a pre-determined value. In each step the…
The study of approximate matching in the Massively Parallel Computations (MPC) model has recently seen a burst of breakthroughs. Despite this progress, however, we still have a far more limited understanding of maximal matching which is one…
We study a problem related to coin flipping, coding theory, and noise sensitivity. Consider a source of truly random bits $x \in \bits^n$, and $k$ parties, who have noisy versions of the source bits $y^i \in \bits^n$, where for all $i$ and…
Squares (fragments of the form $xx$, for some string $x$) are arguably the most natural type of repetition in strings. The basic algorithmic question concerning squares is to check if a given string of length $n$ is square-free, that is,…
The similarities between gated quantum dots and the transistors in modern microelectronics - in fabrication methods, physical structure, and voltage scales for manipulation - have led to great interest in the development of quantum bits…
The stochastic block model is a classical cluster-exhibiting random graph model that has been widely studied in statistics, physics and computer science. In its simplest form, the model is a random graph with two equal-sized clusters, with…
The quantum Fisher information of a quantum state with respect to a certain parameter quantifies the sensitivity of the quantum state to changes in that parameter. Maximizing the quantum Fisher information is essential for achieving the…
Kernel random matrices have attracted a lot of interest in recent years, from both practical and theoretical standpoints. Most of the theoretical work so far has focused on the case were the data is sampled from a low-dimensional structure.…
In holonomic quantum computation, single-qubit gates are performed using driving protocols that trace out closed loops on the Bloch sphere, making them robust to certain pulse errors. However, dephasing noise that is transverse to the…
A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…
Alice and Bob want to know if two strings of length n are almost equal. That is, do they differ on \textit{at most} a bits? Let 0\leq a\leq n-1. We show that any deterministic protocol, as well as any error-free quantum protocol (C*…
We analyze the information efficiency of a deep-space optical communication link with background noise employing the pulse position modulation (PPM) format and a direct-detection receiver based on Geiger-mode photon counting. The…
The spinor representation of spin-1/2 states can equally well be mapped to a single unit quaternion, yielding a new perspective despite the equivalent mathematics. This paper first demonstrates a useable map that allows Bloch-sphere…
The Bloch sphere representation is a geometric model for all possible quantum states of a two-level system that can be used to describe the time dynamics of a qubit. As explicit application, we consider the time dynamics of a particle in a…
Lechner, Hauke, and Zoller proposed a parity-encoded spin-embedding scheme for quantum annealing (QA) with all-to-all connectivity to avoid the issue of limited connectivity in near-term QA hardware and to enable the implementation thereof…