arXiv subjects

Shesha Raghunathan

Publications and source records attributed to Shesha Raghunathan.

6 recordsLinked to original sources

arXiv2024

Efficient Syndrome Decoder for Heavy Hexagonal QECC via Machine Learning

Error syndromes for heavy hexagonal code and other topological codes such as surface code have typically been decoded by using Minimum Weight Perfect Matching (MWPM) based methods. Recent advances have shown that topological codes can be efficiently decoded by deploying machine learning (ML) techniques, in particular with neural networks. In this work, we first propose an ML based decoder for heavy hexagonal code and establish its efficiency in terms of the values of threshold and pseudo-threshold, for various noise models. We show that the proposed ML based decoding method achieves $\sim5 \times$ higher values of threshold than that for MWPM. Next, exploiting the property of subsystem codes, we define gauge equivalence for heavy hexagonal code, by which two distinct errors can belong to the same error class. A linear search based method is proposed for determining the equivalent error classes. This provides a quadratic reduction in the number of error classes to be considered for both bit flip and phase flip errors, and thus a further improvement of $\sim 14\%$ in the threshold over the basic ML decoder. Lastly, a novel technique based on rank to determine the equivalent error classes is presented, which is empirically faster than the one based on linear search.

cs.IT↗

arXiv2021

Depth Optimized Ansatz Circuit in QAOA for Max-Cut

While a Quantum Approximate Optimization Algorithm (QAOA) is intended to provide a quantum advantage in finding approximate solutions to combinatorial optimization problems, noise in the system is a hurdle in exploiting its full potential. Several error mitigation techniques have been studied to lessen the effect of noise on this algorithm. Recently, Majumdar et al. proposed a Depth First Search (DFS) based method to reduce $n-1$ CNOT gates in the ansatz design of QAOA for finding Max-Cut in a graph G = (V, E), |V| = n. However, this method tends to increase the depth of the circuit, making it more prone to relaxation error. The depth of the circuit is proportional to the height of the DFS tree, which can be $n-1$ in the worst case. In this paper, we propose an $O(Δ\cdot n^2)$ greedy heuristic algorithm, where $Δ$ is the maximum degree of the graph, that finds a spanning tree of lower height, thus reducing the overall depth of the circuit while still retaining the $n-1$ reduction in the number of CNOT gates needed in the ansatz. We numerically show that this algorithm achieves nearly 10 times increase in the probability of success for each iteration of QAOA for Max-Cut. We further show that although the average depth of the circuit produced by this heuristic algorithm still grows linearly with n, our algorithm reduces the slope of the linear increase from 1 to 0.11.

quant-ph↗

arXiv2021

Optimizing Ansatz Design in QAOA for Max-cut

Quantum Approximate Optimization Algorithm (QAOA) is studied primarily to find approximate solutions to combinatorial optimization problems. For a graph with $n$ vertices and $m$ edges, a depth $p$ QAOA for the Max-cut problem requires $2\cdot m \cdot p$ CNOT gates. CNOT is one of the primary sources of error in modern quantum computers. In this paper, we propose two hardware independent methods to reduce the number of CNOT gates in the circuit. First, we present a method based on Edge Coloring of the input graph that minimizes the the number of cycles (termed as depth of the circuit), and reduces upto $\lfloor \frac{n}{2} \rfloor$ CNOT gates. Next, we depict another method based on Depth First Search (DFS) on the input graph that reduces $n-1$ CNOT gates, but increases depth of the circuit moderately. We analytically derive the condition for which the reduction in CNOT gates overshadows this increase in depth, and the error probability of the circuit is still lowered. We show that all IBM Quantum Hardware satisfy this condition. We simulate these two methods for graphs of various sparsity with the \textit{ibmq\_manhattan} noise model, and show that the DFS based method outperforms the edge coloring based method, which in turn, outperforms the traditional QAOA circuit in terms of reduction in the number of CNOT gates, and hence the probability of error of the circuit.

quant-ph↗

arXiv2010

Continuous monitoring can improve single-photon probability

An engineering technique using continuous quantum measurement together with a change detection algorithm is proposed to improve the probability of single photon emission for a quantum-dot based single-photon source. The technique involves continuous monitoring of the emitter, integrating the measured signal, and a simple change detection circuit to decide when to stop pumping. The idea is to pump just long enough such that the emitter $+$ cavity system is in a state that can emit at most one photon with high probability. Continuous monitoring provides partial information on the state of the emitter. This technique is useful when the system is operating in the weak coupling regime, and the rate of pumping is smaller than, or comparable to, the emitter-cavity coupling strength, as can be the case for electrical pumping.

quant-ph↗

arXiv2010

Gaussian approximation and single-spin measurement in OSCAR MRFM with spin noise

A promising technique for measuring single electron spins is magnetic resonance force microscopy (MRFM), in which a microcantilever with a permanent magnetic tip is resonantly driven by a single oscillating spin. If the quality factor of the cantilever is high enough, this signal will be amplified over time to the point that it can be detected by optical or other techniques. An important requirement, however, is that this measurement process occur on a time scale short compared to any noise which disturbs the orientation of the measured spin. We describe a model of spin noise for the MRFM system, and show how this noise is transformed to become time-dependent in going to the usual rotating frame. We simplify the description of the cantilever-spin system by approximating the cantilever wavefunction as a Gaussian wavepacket, and show that the resulting approximation closely matches the full quantum behavior. We then examine the problem of detecting the signal for a cantilever with thermal noise and spin with spin noise, deriving a condition for this to be a useful measurement.

quant-ph↗

arXiv2008

Continuous monitoring can improve indistinguishability of a single-photon source

A new engineering technique using continuous quantum measurement in conjunction with feed-forward is proposed to improve indistinguishability of a single-photon source. The technique involves continuous monitoring of the state of the emitter, processing the noisy output signal with a simple linear estimation algorithm, and feed forward to control a variable delay at the output. In the weak coupling regime, the information gained by monitoring the state of the emitter is used to reduce the time uncertainty inherent in photon emission from the source, which improves the indistinguishability of the emitted photons.

quant-ph↗