Searcharxiv⌕ Search

arXiv subjects

Mihir Pant

Publications and source records attributed to Mihir Pant.

At least 19 recordsLinked to original sources
arXiv2026

Macromux: scalable postselection for high-threshold fault-tolerant quantum computation

We introduce a new resource-efficient scheme for fault-tolerant quantum computation known as `macroscale multiplexing' (or simply `Macromux'), that utilizes scalable postselection to significantly improve the threshold of a given fault-tolerant protocol against both Pauli and erasure errors. Macromux is a hierarchical method for postselecting on constant-size space-time windows of a fault tolerant protocol, requiring only constant additional overheads. The method can be straightforwardly implemented for any fault-tolerant protocol and in any architecture that has access to routing and memory, such as linear-optical fusion-based architectures. We construct fault-tolerant protocols that, to our knowledge, have the highest thresholds in the literature; we perform simulations of fusion-based schemes based on the surface code, showing a maximum possible increase in Pauli thresholds of up to a factor of $\sim6$ (from $1.0\%$ to $5.9\%$). Our schemes are highly-resource efficient, and can for example, double the loss thresholds of some photonic fusion-based protocols using as little as $3 \times$ overhead.

quant-ph↗
arXiv2023

Fault-tolerant complexes

Fault-tolerant complexes describe surface-code fault-tolerant protocols from a single geometric object. We first introduce fusion complexes that define a general family of fusion-based quantum computing (FBQC) fault-tolerant quantum protocols based on surface codes. We show that any 3-dimensional cell complex where each edge has four incident faces gives a valid fusion complex. This construction enables an automated search for fault tolerance schemes, allowing us to identify 627 examples within a moderate search time. We implement this using the open-source software tool Gavrog and present threshold results for a variety of schemes, finding fusion networks with higher erasure and Pauli thresholds than those existing in the literature. We then define more general structures we call fault-tolerant complexes that provide a homological description of fault tolerance from a large family of low-level error models, which include circuit-based computation, floquet-based computation, and FBQC with multi-qubit measurements. This extends the applicability of homological descriptions of fault tolerance, and enables the generation of many new schemes which have not been previously identified. We also define families of fault-tolerant complexes for color codes and 3d single-shot subsystem codes, which enables similar constructive methods, and we present several new examples of each.

quant-ph↗
arXiv2023

Increasing error tolerance in quantum computers with dynamic bias arrangement

Many quantum operations are expected to exhibit bias in the structure of their errors. Recent works have shown that a fixed bias can be exploited to improve error tolerance by statically arranging the errors in beneficial configurations. In some cases an error bias can be dynamically reconfigurable, an example being linear optical fusion where the basis of a fusion failure can be chosen before the measurement is made. Here we introduce methods for increasing error tolerance in this setting by using classical decision-making to adaptively choose the bias in measurements as a fault tolerance protocol proceeds. We study this technique in the setting of linear optical fusion based quantum computing (FBQC). We provide examples demonstrating that by dynamically arranging erasures, the loss tolerance can be tripled when compared to a static arrangement of biased errors while using the same quantum resources: we show that for the best FBQC architecture of Bartolucci et al. (2023) the threshold increases from $2.7\%$ to $7.5\%$ per photon with the same resource state by using dynamic biasing. Our method does not require any specific code structure beyond having a syndrome graph representation. We have chosen to illustrate these techniques using an architecture which is otherwise identical to that in Bartolucci et al. (2023), but deployed together with other techniques, such as different fusion networks, higher loss thresholds are possible.

quant-ph↗
arXiv2022

Fault-tolerant Post-Selection for Low Overhead Magic State Preparation

We introduce a framework for fault-tolerant post-selection (FTPS) of fault-tolerant codes and channels -- such as those based on surface-codes -- using soft-information metrics based on visible syndrome and erasure information. We introduce several metrics for ranking configurations of syndromes and erasures. In particular, we introduce the \emph{logical gap} (and variants thereof) as a powerful soft-information metric for predicting logical error rates of fault-tolerant channels based on topological error-correcting codes. The logical gap is roughly the unsigned weight difference between inequivalent logical corrections and is adaptable to any tailored noise model or decoder. We deploy this framework to prepare high-quality surface code magic states with low overhead under a model of independent and identically distributed (\emph{i.i.d.}) Pauli and erasure errors. Post-selection strategies based on the logical gap can suppress the encoding error rate of a magic state preparation channel to the level of the physical error rate with low overhead. For example, when operating at $60\%$ the bulk threshold of the corresponding surface code, an overall reduction of the encoding error rate by a factor of $15$ is achievable with a relative overhead factor of ${< 2}$ (approximately $23$ times less than that of simple syndrome-counting rules). We analyze a schematic buffer architecture for implementing post-selection rules on magic state factories in the context of magic state distillation. The FTPS framework can be utilized for mitigating errors in more general fault-tolerant logical channels.

quant-ph↗
arXiv2021

Creation of Entangled Photonic States Using Linear Optics

Using only linear optical elements, the creation of dual-rail photonic entangled states is inherently probabilistic. Known entanglement generation schemes have low success probabilities, requiring large-scale multiplexing to achieve near-deterministic operation of quantum information processing protocols. In this paper, we introduce multiple techniques and methods to generate photonic entangled states with high probability, which have the potential to reduce the footprint of Linear Optical Quantum Computing (LOQC) architectures drastically. Most notably, we are showing how to improve Bell state preparation from four single photons to up to p=2/3, boost Type-I fusion to 75% with a dual-rail Bell state ancilla and improve Type-II fusion beyond the limits of Bell state discrimination.

quant-ph↗
arXiv2021

Interleaving: Modular architectures for fault-tolerant photonic quantum computing

Useful fault-tolerant quantum computers require very large numbers of physical qubits. Quantum computers are often designed as arrays of static qubits executing gates and measurements. Photonic qubits require a different approach. In photonic fusion-based quantum computing (FBQC), the main hardware components are resource-state generators (RSGs) and fusion devices connected via waveguides and switches. RSGs produce small entangled states of a few photonic qubits, whereas fusion devices perform entangling measurements between different resource states, thereby executing computations. In addition, low-loss photonic delays such as optical fiber can be used as fixed-time quantum memories simultaneously storing thousands of photonic qubits. Here, we present a modular architecture for FBQC in which these components are combined to form "interleaving modules" consisting of one RSG with its associated fusion devices and a few fiber delays. Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space. Networks of modules are universal fault-tolerant quantum computers, which we demonstrate using surface codes and lattice surgery as a guiding example. Our numerical analysis shows that in a network of modules containing 1-km-long fiber delays, each RSG can generate four logical distance-35 surface-code qubits while tolerating photon loss rates above 2% in addition to the fiber-delay loss. We illustrate how the combination of interleaving with further uses of non-local fiber connections can reduce the cost of logical operations and facilitate the implementation of unconventional geometries such as periodic boundaries or stellated surface codes. Interleaving applies beyond purely optical architectures, and can also turn many small disconnected matter-qubit devices with transduction to photons into a large-scale quantum computer.

quant-ph↗
arXiv2021

Fusion-based quantum computation

We introduce fusion-based quantum computing (FBQC) - a model of universal quantum computation in which entangling measurements, called fusions, are performed on the qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics. FBQC can offer significant architectural simplifications, enabling hardware made up of many identical modules, requiring an extremely low depth of operations on each physical qubit and reducing classical processing requirements. We present two pedagogical examples of fault-tolerant schemes constructed in this framework and numerically evaluate their threshold under a hardware agnostic fusion error model including both erasure and Pauli error. We also study an error model of linear optical quantum computing with probabilistic fusion and photon loss. In FBQC the non-determinism of fusion is directly dealt with by the quantum error correction protocol, along with other errors. We find that tailoring the fault-tolerance framework to the physical system allows the scheme to have a higher threshold than schemes reported in literature. We present a ballistic scheme which can tolerate a 10.4% probability of suffering photon loss in each fusion.

quant-ph↗
arXiv2020

Entanglement generation in a quantum network at distance-independent rate

We develop a protocol for entanglement generation in the quantum internet that allows a repeater node to use $n$-qubit Greenberger-Horne-Zeilinger (GHZ) projective measurements that can fuse $n$ successfully-entangled {\em links}, i.e., two-qubit entangled Bell pairs shared across $n$ network edges, incident at that node. Implementing $n$-fusion, for $n \ge 3$, is in principle not much harder than $2$-fusions (Bell-basis measurements) in solid-state qubit memories. If we allow even $3$-fusions at the nodes, we find---by developing a connection to a modified version of the site-bond percolation problem---that despite lossy (hence probabilistic) link-level entanglement generation, and probabilistic success of the fusion measurements at nodes, one can generate entanglement between end parties Alice and Bob at a rate that stays constant as the distance between them increases. We prove that this powerful network property is not possible to attain with any quantum networking protocol built with Bell measurements and multiplexing alone. We also design a two-party quantum key distribution protocol that converts the entangled states shared between two nodes into a shared secret, at a key generation rate that is independent of the distance between the two parties.

quant-ph↗
arXiv2020

Percolation Thresholds for Robust Network Connectivity

Communication networks, power grids, and transportation networks are all examples of networks whose performance depends on reliable connectivity of their underlying network components even in the presence of usual network dynamics due to mobility, node or edge failures, and varying traffic loads. Percolation theory quantifies the threshold value of a local control parameter such as a node occupation (resp., deletion) probability or an edge activation (resp., removal) probability above (resp., below) which there exists a giant connected component (GCC), a connected component comprising of a number of occupied nodes and active edges whose size is proportional to the size of the network itself. Any pair of occupied nodes in the GCC is connected via at least one path comprised of active edges and occupied nodes. The mere existence of the GCC itself does not guarantee that the long-range connectivity would be robust, e.g., to random link or node failures due to network dynamics. In this paper, we explore new percolation thresholds that guarantee not only spanning network connectivity, but also robustness. We define and analyze four measures of robust network connectivity, explore their interrelationships, and numerically evaluate the respective robust percolation thresholds for the 2D square lattice.

physics.soc-ph↗
arXiv2019

Percolation based architecture for cluster state creation using photon-mediated entanglement between atomic memories

A central challenge for many quantum technologies concerns the generation of large entangled states of individually addressable quantum memories. Here, we show that percolation theory allows the rapid production of arbitrarily large graph states by heralded photonic entanglement in a lattice of atomic memories. This approach can greatly reduce the time required to produce large cluster resource states for quantum information processing, including states required for universal one-way quantum computing. This reduction puts our architecture in an operational regime where demonstrated collection, coupling and detection efficiencies are sufficient for generating resource states for universal quantum computing within an experimentally demonstrated coherence time. The approach also dispenses the need for time consuming feed-forward, high-cooperativity interfaces and ancilla single photons, and can also tolerate a high rate of site imperfections. We also derive the minimum coherence time for the atomic memory to scalably create large-scale photonic-entanglement without feed-forward as a function of collection efficiency, setting a critical benchmark for future experimental demonstrations. We also propose a variant of the architecture with long-range connections that makes our architecture even more resilient to low site yields. We analyze our architecture for nitrogen-vacancy (NV) centers in diamond, though the approach applies to any atomic or atom-like system.

quant-ph↗
arXiv2019

Single Photon Detection by Cavity-Assisted All-Optical Gain

We consider the free carrier dispersion effect in a semiconductor nanocavity in the limit of discrete photoexcited electron-hole pairs. This analysis reveals the possibility of ultrafast, incoherent transduction and gain from a single photon signal to a strong coherent probe field. Homodyne detection of the displaced probe field enables a new method for room temperature, photon-number-resolving single photon detection. In particular, we estimate that a single photon absorbed within a silicon nanocavity can, within tens of picoseconds, be detected with $\sim 99\%$ efficiency and a dark count rate on the order of kHz assuming a mode volume $V_\text{eff}\sim 10^{-2}(λ/n_\text{Si})^3$ for a 4.5 micron probe wavelength and a loaded quality factor $Q$ on the order of $10^4$.

physics.optics↗
arXiv2018

Scalable feedback control of single photon sources for photonic quantum technologies

Large-scale quantum technologies require exquisite control over many individual quantum systems. Typically, such systems are very sensitive to environmental fluctuations, and diagnosing errors via measurements causes unavoidable perturbations. In this work we present an in situ frequency locking technique that monitors and corrects frequency variations in single photon sources based on microring resonators. By using the same classical laser fields required for photon generation as a probe to diagnose variations in the resonator frequency, our protocol applies feedback control to correct photon frequency errors in parallel to the optical quantum computation without disturbing the physical qubit. We implement our technique on a silicon photonic device and demonstrate sub 1 pm frequency stabilization in the presence of applied environmental noise, corresponding to a fractional frequency drift of <1 % of a photon linewidth. Using these methods we demonstrate feedback controlled quantum state engineering. By distributing a single local oscillator across a single chip or network of chips, our approach enables frequency locking of many single photon sources for large-scale photonic quantum technologies.

quant-ph↗
arXiv2018

Temporally and spectrally multiplexed single photon source using quantum feedback control for scalable photonic quantum technologies

Current proposals for scalable photonic quantum technologies require on-demand sources of indistinguishable single photons with very high efficiency (having unheralded loss below $1\%$). Even with recent progress in the field there is still a significant gap between the requirements and state of the art performance. Here, we propose an on-chip source of multiplexed, heralded photons. Using quantum feedback control on a photon storage cavity with an optimized driving protocol, we estimate an on-demand efficiency of $99\%$ and unheralded loss of order $1\%$, assuming high efficiency detectors and intrinsic cavity quality factors of order $10^8$. We further explain how temporal- and frequency-multiplexing can be used in parallel to significantly reduce device requirements if single photon frequency conversion is possible with efficiency in the same range of $99\%$.

quant-ph↗
arXiv2017

Routing entanglement in the quantum internet

Remote quantum entanglement can enable numerous applications including distributed quantum computation, secure communication, and precision sensing. In this paper, we consider how a quantum network-nodes equipped with limited quantum processing capabilities connected via lossy optical links-can distribute high-rate entanglement simultaneously between multiple pairs of users (multiple flows). We develop protocols for such quantum "repeater" nodes, which enable a pair of users to achieve large gains in entanglement rates over using a linear chain of quantum repeaters, by exploiting the diversity of multiple paths in the network. Additionally, we develop repeater protocols that enable multiple user pairs to generate entanglement simultaneously at rates that can far exceed what is possible with repeaters time sharing among assisting individual entanglement flows. Our results suggest that the early-stage development of quantum memories with short coherence times and implementations of probabilistic Bell-state measurements can have a much more profound impact on quantum networks than may be apparent from analyzing linear repeater chains. This framework should spur the development of a general quantum network theory, bringing together quantum memory physics, quantum information theory, and computer network theory.

quant-ph↗
arXiv2017

Percolation thresholds for photonic quantum computing

Any quantum algorithm can be implemented by an adaptive sequence of single node measurements on an entangled cluster of qubits in a square lattice topology. Photons are a promising candidate for encoding qubits but assembling a photonic entangled cluster with linear optical elements relies on probabilistic operations. Given a supply of $n$-photon-entangled microclusters, using a linear optical circuit and photon detectors, one can assemble a random entangled state of photons that can be subsequently "renormalized" into a logical cluster for universal quantum computing. In this paper, we prove that there is a fundamental tradeoff between $n$ and the minimum success probability $λ_c^{(n)}$ that each two-photon linear-optical fusion operation must have, in order to guarantee that the resulting state can be renormalized: $λ_c^{(n)} \ge 1/(n-1)$. We present a new way of formulating this problem where $λ_c^{(n)}$ is the bond percolation threshold of a logical graph and provide explicit constructions to produce a percolated cluster using $n=3$ photon microclusters (GHZ states) as the initial resource. We settle a heretofore open question by showing that a renormalizable cluster can be created with $3$-photon microclusters over a 2D graph without feedforward, which makes the scheme extremely attractive for an integrated-photonic realization. We also provide lattice constructions, which show that $0.5 \le λ_c^{(3)} \le 0.5898$, improving on a recent result of $λ_c^{(3)} \le 0.625$. Finally, we discuss how losses affect the bounds on the threshold, using loss models inspired by a recently-proposed method to produce photonic microclusters using quantum dot emitters.

quant-ph↗
arXiv2016

Rate-distance tradeoff and resource costs for all-optical quantum repeaters

We present a resource-performance tradeoff of an all-optical quantum repeater that uses photon sources, linear optics, photon detectors and classical feedforward at each repeater node, but no quantum memories. We show that the quantum-secure key rate has the form $R(η) = Dη^s$ bits per mode, where $η$ is the end-to-end channel's transmissivity, and the constants $D$ and $s$ are functions of various device inefficiencies and the resource constraint, such as the number of available photon sources at each repeater node. Even with lossy devices, we show that it is possible to attain $s < 1$, and in turn outperform the maximum key rate attainable without quantum repeaters, $R_{\rm direct}(η) = -\log_2(1-η) \approx (1/\ln 2)η$ bits per mode for $η\ll 1$, beyond a certain total range $L$, where $η\sim e^{-αL}$ in optical fiber. We also propose a suite of modifications to a recently-proposed all-optical repeater protocol that ours builds upon, which lower the number of photon sources required to create photonic clusters at the repeaters so as to outperform $R_{\rm direct}(η)$, from $\sim 10^{11}$ to $\sim 10^{6}$ photon sources per repeater node. We show that the optimum separation between repeater nodes is independent of the total range $L$, and is around $1.5$ km for assumptions we make on various device losses.

quant-ph↗
arXiv2015

High Dimensional Unitary Transformations and Boson Sampling on Temporal Modes using Dispersive Optics

We present methods which allow orders of magnitude increase in the number of modes in linear optics experiments by moving from spatial encoding to temporal encoding and using dispersion. This enables significant practical advantages for linear quantum optics and Boson Sampling experiments. Passing consecutively heralded photons through time-independent dispersion and measuring the output time of the photons is equivalent to a Boson Sampling experiment for which no efficient classical algorithm is reported, to our knowledge. With time-dependent dispersion, it is possible to implement arbitrary single-particle unitaries. Given the relatively simple requirements of these schemes, they provide a path to realizing much larger linear quantum optics experiments including post-classical Boson Sampling machines.

quant-ph↗