arXiv subjects

Arshag Danageozian

Publications and source records attributed to Arshag Danageozian.

10 recordsLinked to original sources

arXiv2026

From Syndromes to Computation: A General Framework for Logical Operations in Quantum Error-Correcting Codes

Fault-tolerant quantum computation requires error-correcting codes that not only protect quantum information but also support useful logical operations with practical physical realizations. Here we develop a general framework in which the stabilizer syndromes of commuting Pauli rotations directly organize logical-gate design. We derive an exact codespace-preservation condition valid at arbitrary rotation angles, providing a common stabilizer-level description for CSS and non-CSS codes and for both Clifford and non-Clifford operations. A particularly useful equal-syndrome specialization reduces Clifford gate design to stabilizer factorization, yields a general generator weight bound of $\lceil d/2\rceil$ for distance-$d$ codes, and systematically extends to logical rotations higher in the Clifford hierarchy. Applied to bivariate-bicycle (BB) and non-CSS Mirror qLDPC codes, the framework gives explicit low-weight Clifford and controlled-phase gates. Our implementations yield new low-weight gates, including an addressed $T$ gate on the $[[16,4,4]]$ BB code, $T$-type rotations on the $[[64,8,8]]$ BB code, and CCZ-, CS-, and $T$-type operations on the $[[36,6,6]]$ Mirror code. We also develop analytic constructions using Clifford algebra bases, which turn the syndrome constraints into explicit algebraic relations and provide a systematic route to logical addressability. We use this approach to analytically construct addressed CNOT, SWAP, controlled, and CCZ-type gates on recursive hypercube codes. An independent construction on middle quantum Reed--Muller codes yields C${}^r$Z gates that saturate the equal-syndrome weight bound. These results establish stabilizer syndromes as a constructive link between the stabilizer structure of a quantum code, the logical computations it can directly support, and the fault-tolerance properties of their physical realizations.

quant-ph↗

arXiv2026

Protocol for Efficient Generation of Fusion-Based Quantum Computing Resource States from Quantum Emitters

Fusion-based quantum computing (FBQC) relies on a set of small, typically photonic, resource states that are fused together through Bell state measurements. The main bottleneck of FBQC is the low rate of generating the resource states, which stems from the probabilistic nature of photonic fusion gates. Previous work introduced a general algorithm for constructing circuits that deterministically generate photonic resource states from a minimal number of quantum emitters for a specified photon emission ordering. However, finding the minimal number of emitters and CNOT gates across all possible orderings is an NP-hard problem. Here, we exploit the symmetries present in FBQC resource states to dramatically simplify this optimization problem. We find that logically encoded 24-photon FBQC resource states can be produced using as few as 3 emitters and 11 CNOTs.

quant-ph↗

arXiv2025

Many-Body Entanglement in Solid-State Emitters

The preparation and control of quantum states lie at the heart of quantum information science (QIS). Recent advances in solid-state quantum emitters (QEs) and nanophotonics have transformed the landscape of quantum photonic technologies, enabling scalable generation of quantum states of light and matter. A new frontier in solid-state quantum photonics is the engineering of many-body interactions between QEs and photons to achieve robust coherence and controllable many-body entanglement. These entangled states, including photonic graph and cluster states, superradiant emission, and emergent quantum phases, are promising for quantum computation, sensing, and simulation. However, intrinsic inhomogeneities and decoherence in solid-state platforms pose significant challenges to realize such complex entangled states. This review provides an overview of the fundamental many-body interactions and dynamics at the light-matter interfaces of solid-state QEs, and discusses recent advances in mitigating decoherence and harnessing robust many-body coherence.

quant-ph↗

arXiv2024

Polarization-Entanglement Dynamics in Optical Fibers: Mitigating Decay in the Non-Markovian Regime with Dynamical Decoupling

Future distributed quantum systems and networks are likely to rely, at least in part, on the existing fiber infrastructure for entanglement distribution; hence, a precise understanding of the adverse effects of imperfections in optical fibers on entanglement is essential to their operation. Here, we consider maximally entangled polarization qubits and study the decay of the entanglement caused by spatial fluctuations in the refractive index of optical fibers. We study this entanglement dynamics using the spin-boson model and numerically solve our system of equations using the hierarchical equations of motion (HEOM) formalism. We show that within the range of practically relevant system parameters, our developed model exhibits both Markovian and non-Markovian entanglement decay behavior. Further, to counter the observed entanglement decay, we propose the implementation of dynamical decoupling in optical fibers using spaced half waveplates. In particular, we numerically model the time-dependent Hamiltonians of the Carr-Purcell-Meiboom-Gill and Uhrig dynamical decoupling schemes and show a reduced rate of entanglement decay even with sparsely spaced half waveplates along the length of optical fiber. Finally, we evaluate the performance of these two schemes in multiple system configurations.

quant-ph↗

arXiv2023

Recovery With Incomplete Knowledge: Fundamental Bounds on Real-Time Quantum Memories

The recovery of fragile quantum states from decoherence is the basis of building a quantum memory, with applications ranging from quantum communications to quantum computing. Many recovery techniques, such as quantum error correction, rely on the apriori knowledge of the environment noise parameters to achieve their best performance. However, such parameters are likely to drift in time in the context of implementing long-time quantum memories. This necessitates using a "spectator" system, which estimates the noise parameter in real-time, then feed-forwards the outcome to the recovery protocol as a classical side-information. The memory qubits and the spectator system hence comprise the building blocks for a real-time (i.e. drift-adapting) quantum memory. In this article, I consider spectator-based (incomplete knowledge) recovery protocols as a real-time parameter estimation problem (generally with nuisance parameters present), followed by the application of the "best-guess" recovery map to the memory qubits, as informed by the estimation outcome. I present information-theoretic and metrological bounds on the performance of this protocol, quantified by the diamond distance between the "best-guess" recovery and optimal recovery outcomes, thereby identifying the cost of adaptation in real-time quantum memories. Finally, I provide fundamental bounds for multi-cycle recovery in the form of recurrence inequalities. The latter suggests that incomplete knowledge of the noise could be an advantage, as errors from various cycles can cohere. These results are illustrated for the approximate [4,1] code of the amplitude-damping channel and relations to various fields are discussed.

quant-ph↗

arXiv2023

Adaptive mitigation of time-varying quantum noise

Current quantum computers suffer from non-stationary noise channels with high error rates, which undermines their reliability and reproducibility. We propose a Bayesian inference-based adaptive algorithm that can learn and mitigate quantum noise in response to changing channel conditions. Our study emphasizes the need for dynamic inference of critical channel parameters to improve program accuracy. We use the Dirichlet distribution to model the stochasticity of the Pauli channel. This allows us to perform Bayesian inference, which can improve the performance of probabilistic error cancellation (PEC) under time-varying noise. Our work demonstrates the importance of characterizing and mitigating temporal variations in quantum noise, which is crucial for developing more accurate and reliable quantum technologies. Our results show that Bayesian PEC can outperform non-adaptive approaches by a factor of 4.5x when measured using Hellinger distance from the ideal distribution.

quant-ph↗

arXiv2022

Noisy Coherent Population Trapping: Applications to Noise Estimation and Qubit State Preparation

Coherent population trapping is a well-known quantum phenomenon in a driven $Λ$ system, with many applications across quantum optics. However, when a stochastic bath is present in addition to vacuum noise, the observed trapping is no longer perfect. Here we derive a time-convolutionless master equation describing the equilibration of the $Λ$ system in the presence of additional temporally correlated classical noise, with an unknown decay parameter. Our simulations show a one-to-one correspondence between the decay parameter and the depth of the characteristic dip in the photoluminescence spectrum, thereby enabling the unknown parameter to be estimated from the observed spectra. We apply our analysis to the problem of qubit state initialization in a $Λ$ system via dark states and show how the stochastic bath affects the fidelity of such initialization as a function of the desired dark-state amplitudes. We show that an optimum choice of Rabi frequencies is possible.

quant-ph↗

arXiv2021

Thermodynamic Constraints on Quantum Information Gain and Error Correction: A Triple Trade-Off

Quantum error correction (QEC) is a procedure by which the quantum state of a system is protected against a known type of noise, by preemptively adding redundancy to that state. Such a procedure is commonly used in quantum computing when thermal noise is present. Interestingly, thermal noise has also been known to play a central role in quantum thermodynamics (QTD). This fact hints at the applicability of certain QTD statements in the QEC of thermal noise, which has been discussed previously in the context of Maxwell's demon. In this article, we view QEC as a quantum heat engine with a feedback controller (i.e., a demon). We derive an upper bound on the measurement heat dissipated during the error-identification stage in terms of the Groenewold information gain, thereby providing the latter with a physical meaning also when it is negative. Further, we derive the second law of thermodynamics in the context of this QEC engine, operating with general quantum measurements. Finally, we show that, under a set of physically motivated assumptions, this leads to a fundamental triple trade-off relation, which implies a trade-off between the maximum achievable fidelity of QEC and the super-Carnot efficiency that heat engines with feedback controllers have been known to possess. A similar trade-off relation occurs for the thermodynamic efficiency of the QEC engine and the efficacy of the quantum measurement used for error identification.

quant-ph↗

arXiv2018

Quantum non-locality co-exists with locality

Quantum non-locality is normally defined via violations of Bell's inequalities that exclude certain classical hidden variable theories from explaining quantum correlations. Another definition of non-locality refers to the wave-function collapse thereby one can prepare a quantum state from arbitrary far away. In both cases one can debate on whether non-locality is a real physical phenomenon, e.g. one can employ formulations of quantum mechanics that does not use collapse, or one can simply refrain from explaining quantum correlations via classical hidden variables. Here we point out that there is a non-local effect within quantum mechanics, i.e. without involving hidden variables or collapse. This effect is seen via imprecise (i.e. interval-valued) joint probability of two observables, which replaces the ill-defined notion of the precise joint probability for non-commuting observables. It is consistent with all requirements for the joint probability, e.g. those for commuting observales. The non-locality amounts to a fact that (in a two-particle system) the joint imprecise probability of non-commuting two-particle observables (i.e. tensor product of single-particle observables) does not factorize into single-particle contributions, even for uncorrelated states of the two-particle system. The factorization is recovered for a less precise (i.e. the one involving a wider interval) joint probability. This approach to non-locality reconciles it with locality, since the latter emerges as a less precise description.

quant-ph↗

arXiv2018

Excluding joint probabilities from quantum theory

Quantum theory does not provide a unique definition for the joint probability of two non-commuting observables, which is the next important question after the Born's probability for a single observable. Instead, various definitions were suggested, e.g. via quasi-probabilities or via hidden-variable theories. After reviewing open issues of the joint probability, we relate it to quantum imprecise probabilities, which are non-contextual and are consistent with all constraints expected from a quantum probability. We study two non-commuting observables in a two-dimensional Hilbert space and show that there is no precise joint probability that applies for any quantum state and is consistent with imprecise probabilities. This contrasts to theorems by Bell and Kochen-Specker that exclude joint probabilities for more than two non-commuting observables, in Hilbert space with dimension larger than two. If measurement contexts are included into the definition, joint probabilities are not anymore excluded, but they are still constrained by imprecise probabilities.

quant-ph↗