arXiv subjects

Zain H. Saleem

Publications and source records attributed to Zain H. Saleem.

At least 37 records · Page 2Linked to original sources

arXiv2025

QuantEM: The quantum error management compiler

As quantum computing advances toward fault-tolerant architectures, quantum error detection (QED) has emerged as a practical and scalable intermediate strategy in the transition from error mitigation to full error correction. By identifying and discarding faulty runs rather than correcting them, QED enables improved reliability with significantly lower overhead. Applying QED to arbitrary quantum circuits remains challenging, however, because of the need for manual insertion of detection subcircuits, ancilla allocation, and hardware-specific mapping and scheduling. We present QuantEM, a modular and extensible compiler designed to automate the integration of QED codes into arbitrary quantum programs. Our compiler consists of three key modules: (1) program analysis and transformation module to examine quantum programs in a QED-aware context and introduce checks and ancilla qubits, (2) error detection code integration module to map augmented circuits onto specific hardware backends, and (3) postprocessing and resource management for measurement results postprocessing and resource-efficient estimation techniques. The compiler accepts a high-level quantum circuit, a chosen error detection code, and a target hardware topology and then produces an optimized and executable circuit. It can also automatically select an appropriate detection code for the user based on circuit structure and resource estimates. QuantEM currently supports Pauli check sandwiching and Iceberg codes and is designed to support future QED schemes and hardware targets. By automating the complex QED compilation flow, this work reduces developer burden, enables fast code exploration, and ensures consistent and correct application of detection logic across architectures.

quant-ph↗

arXiv2025

MOSAIC: Magnonic Observations of Spin-dependent Axion-like InteraCtions

We introduce an array-scalable, magnon-based detector (MOSAIC) to search for the spin-dependent interactions of electron-coupled axion dark matter. These axions can excite single magnons in magnetic targets, such as the yttrium iron garnet (YIG) spheres used here, which are subsequently sensed by the detector. For MOSAIC, this sensing is implemented by coupling the magnons in the YIG spheres to magnetic-field-resilient single-electron charge-qubits, whose state is then interrogated with a quantum non-demolition measurement. Using standard superconducting fabrication techniques, MOSAIC can integrate many YIG sphere-qubit sensors, forming a large detector array. We outline the detector design and operation, and determine its sensitivity to axion dark matter. We find that a detector built with available technology will exceed the sensitivity of previous ferromagnetic haloscopes, and provides a platform where further improvements in performance would search for electron-coupled axion dark matter in unexplored parameter space.

hep-ph↗

arXiv2024

Dynamic Resource Allocation with Quantum Error Detection

Quantum processing units (QPUs) are highly heterogeneous in terms of physical qubit performance. To add even more complexity, drift in quantum noise landscapes has been well-documented. This makes resource allocation a challenging problem whenever a quantum program must be mapped to hardware. As a solution, we propose a novel resource allocation framework that applies Pauli checks. Pauli checks have demonstrated their efficacy at error mitigation in prior work, and in this paper, we highlight their potential to infer the noise characteristics of a quantum system. Circuits with embedded Pauli checks can be executed on different regions of qubits, and the syndrome data created by error-detecting Pauli checks can be leveraged to guide quantum program outcomes toward regions that produce higher-fidelity final distributions. Using noisy simulation and a real QPU testbed, we show that dynamic quantum resource allocation with Pauli checks can outperform state-of-art mapping techniques, such as those that are noise-aware. Further, when applied toward the Quantum Approximate Optimization Algorithm, techniques guided by Pauli checks demonstrate the ability to increase circuit fidelity 11% on average, and up to 33%.

quant-ph↗

arXiv2024

Quantum Circuit Cutting for Classical Shadows

Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing large quantum circuits into smaller fragments that can be executed more robustly using fewer quantum resources. We introduce a divide-and-conquer circuit cutting method for estimating the expectation values of observables using classical shadows. We derive a general formula for making predictions using the classical shadows of circuit fragments from arbitrarily cut circuits, and provide the sample complexity analysis for the case when observables factorize across fragments. Then, we numerically show that our divide-and-conquer method outperforms traditional uncut shadow tomography when estimating high-weight observables that act non-trivially on many qubits, and discuss the mechanisms for this advantage.

quant-ph↗

arXiv2024

Generation and Life Cycle of Solar Spicules

Physical mechanism for the creation of solar spicules is proposed with three stages of their life cycle. It is assumed that at stage-I, the density hump is formed locally in the xy-plane in lower chromosphere in the presence of temperature gradients of electrons and ions along z-axis (the vertical direction). In this region, the density structure of quasi-neutral $(n_i\simeq n_e=n)$ plasma after taking birth is accelerated in the vertical direction due to the thermal force ${\bf F}_{th} \propto \nabla n(x,y,t) \times (\nabla T_e + \nabla T_i)$. The exact time-dependent analytical solution of two fluid plasma equations is presented assuming that density is maximum at the center and decays away from it gradually. The two dimensional (2D) density structure is created as a step function $H(t)$ in time at bottom of the chromosphere and consequently the vertical plasma velocity turns out to be the ramp function of time $R(t)=t H(t)$ whereas the source term $S(x,y,t)$ for the density follows the delta function $δ(t)$ form. The upward acceleration ${\bf a}=a(x,y)\hat{z}$ produced in this density structure is greater than the downward constant solar acceleration $-{\bf g}_\odot$ in the chromosphere. In the transition region (TR), the temperature gradients are steeper; therefore, the upward acceleration increases in magnitude $g_\odot << a$ and the density hump spends lesser time there. This is stage-II of its life cycle. In stage-III, the density structure enters into corona where the gradients of temperatures vanish and the structure decelerates to zero velocity under the action of the solar gravitational force.

astro-ph.SR↗

arXiv2024

Achieving the Heisenberg limit with Dicke states in noisy quantum metrology

Going beyond the standard quantum limit in noisy quantum metrology is an important and challenging task. Here we show how Dicke states can be used to surpass the standard quantum limit and achieve the Heisenberg limit in open quantum systems. The system we study has qubits symmetrically coupled to a resonator and our objective is to estimate the coupling between the qubits and the resonator. The time-dependent quantum Fisher information with respect to the coupling is studied for this open quantum system where the same decay rates are assumed on all qubits. We show that when the system is initialized to a Dicke state with an optimal excitation number one can go beyond the standard quantum limit and achieve the Heisenberg limit even for finite values of the decays on the qubit and the resonator, particularly when the qubits and resonator are strongly coupled. We compare our results against the highly entangled GHZ state and a completely separable state and show that the GHZ state performs quite poorly whereas under certain noise conditions the separable state is able to go beyond the standard quantum limit due to subsequent interactions with a resonator.

quant-ph↗

arXiv2023

Inferring Quantum Network Topology using Local Measurements

Statistical correlations that can be generated across the nodes in a quantum network depend crucially on its topology. However, this topological information might not be known a priori, or it may need to be verified. In this paper, we propose an efficient protocol for distinguishing and inferring the topology of a quantum network. We leverage entropic quantities -- namely, the von Neumann entropy and the measured mutual information -- as well as measurement covariance to uniquely characterize the topology. We show that the entropic quantities are sufficient to distinguish two networks that prepare GHZ states. Moreover, if qubit measurements are available, both entropic quantities and covariance can be used to infer the network topology without state-preparation assumptions. We show that the protocol can be entirely robust to noise and can be implemented via quantum variational optimization. Numerical experiments on both classical simulators and quantum hardware show that covariance is generally more reliable for accurately and efficiently inferring the topology, whereas entropy-based methods are often better at identifying the absence of entanglement in the low-shot regime.

quant-ph↗

arXiv2023

Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation

Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield and performance. To meet this challenge, distributed architectures composed of many networked quantum computers have been proposed as a viable path to scalability. Such systems will need algorithms and compilers that are tailored to their distributed architectures. In this work we introduce the Quantum Divide and Conquer Algorithm (QDCA), a hybrid variational approach to mapping large combinatorial optimization problems onto distributed quantum architectures. This is achieved through the combined use of graph partitioning and quantum circuit cutting. The QDCA, an example of application-compiler co-design, alters the structure of the variational ansatz to tame the exponential compilation overhead incurred by quantum circuit cutting. The result of this cross-layer co-design is a highly flexible algorithm which can be tuned to the amount of classical or quantum computational resources that are available, and can be applied to both near- and long-term distributed quantum architectures. We simulate the QDCA on instances of the Maximum Independent Set problem and find that it is able to outperform similar classical algorithms. We also evaluate an 8-qubit QDCA ansatz on a superconducting quantum computer and show that circuit cutting can help to mitigate the effects of noise. Our work demonstrates how many small-scale quantum computers can work together to solve problems $85\%$ larger than their own qubit count, motivating the development and potential of large-scale distributed quantum computing.

quant-ph↗

arXiv2023

Optimal time for sensing in open quantum systems

We study the time-dependent quantum Fisher information (QFI) in an open quantum system satisfying the Gorini-Kossakowski-Sudarshan-Lindblad master equation. We also study the dynamics of the system from an effective non-Hermitian dynamics standpoint and use it to understand the scaling of the QFI when multiple probes are used. A focus of our work is how the QFI is maximized at certain times suggesting that the best precision in parameter estimation can be achieved by focusing on these times. The propagation of errors analysis allows us to confirm and better understand this idea. We also propose a parameter estimation procedure involving relatively low resource consuming measurements followed by higher resource consuming measurements and demonstrate it in simulation.

quant-ph↗

arXiv2022

Classical simulators as quantum error mitigators via circuit cutting

We introduce an error mitigation framework that mitigates errors in a quantum circuit using circuit cutting. Our framework can be implemented in polynomial time for a wide variety of quantum circuits. Our technique involves cutting the circuit in such a way that we run the circuit that needs to be executed on the quantum hardware whereas the error mitigation circuit is run on a simulator. We perform error mitigation qubit by qubit and then provide a way to combine the different probabilities from each of the individual qubit error mitigation runs such that the full circuit is error mitigated. We apply our framework to the VQE hardware-efficient ansatz acheiving estimated ground state energies very close to the noise-free simulation results.

quant-ph↗

arXiv2022

Quantum Local Search with the Quantum Alternating Operator Ansatz

We present a new hybrid, local search algorithm for quantum approximate optimization of constrained combinatorial optimization problems. We focus on the Maximum Independent Set problem and demonstrate the ability of quantum local search to solve large problem instances on quantum devices with few qubits. This hybrid algorithm iteratively finds independent sets over carefully constructed neighborhoods and combines these solutions to obtain a global solution. We study the performance of this algorithm on 3-regular, Community, and Erdős-Rényi graphs with up to 100 nodes.

quant-ph↗

arXiv2022

3-D exact analytical solutions of two fluid plasma, MHD and neutral fluid equations for the creation of ordered structures as well as jet-like flows

The 3-D exact analytical solutions of ideal two fluid plasma, single fluid plasma (MHD) and neutral fluid equations have been found using physically justifiable assumptions. Surprisingly these solutions satisfy all non-linearities in the systems. It is pointed out that these solutions explain the fundamental mechanism behind the creation of vast variety of ordered structures in plasmas and fluids. In the limiting case of two dimensional (2-D) dependence of fields, the theoretical model for plasma is applied to explain the formation of spicules in solar chromosphere. It is pointed out that the main contribution of electron (ion) baro clinic vectors is to produce vorticity in the plasma and that magnetic field generation is coupled with the flow of both electrons and ions.

physics.plasm-ph↗

arXiv2021

Approaches to Constrained Quantum Approximate Optimization

We study the costs and benefits of different quantum approaches to finding approximate solutions of constrained combinatorial optimization problems with a focus on Maximum Independent Set. In the Lagrange multiplier approach we analyze the dependence of the output on graph density and circuit depth. The Quantum Alternating Ansatz Approach is then analyzed and we examine the dependence on different choices of initial states. The Quantum Alternating Ansatz Approach, although powerful, is expensive in terms of quantum resources. A new algorithm based on a "Dynamic Quantum Variational Ansatz" (DQVA) is proposed that dynamically changes to ensure the maximum utilization of a fixed allocation of quantum resources. Our analysis and the new proposed algorithm can also be generalized to other related constrained combinatorial optimization problems.

quant-ph↗

arXiv2021

Quantum Circuit Cutting with Maximum Likelihood Tomography

We introduce maximum likelihood fragment tomography (MLFT) as an improved circuit cutting technique for running clustered quantum circuits on quantum devices with a limited number of qubits. In addition to minimizing the classical computing overhead of circuit cutting methods, MLFT finds the most likely probability distribution for the output of a quantum circuit, given the measurement data obtained from the circuit's fragments. We demonstrate the benefits of MLFT for accurately estimating the output of a fragmented quantum circuit with numerical experiments on random unitary circuits. Finally, we show that circuit cutting can estimate the output of a clustered circuit with higher fidelity than full circuit execution, thereby motivating the use of circuit cutting as a standard tool for running clustered circuits on quantum hardware.

quant-ph↗

arXiv2020

Max Independent Set and Quantum Alternating Operator Ansatz

The maximum independent set (MIS) problem of graph theory using the quantum alternating operator ansatz is studied. We perform simulations on the Rigetti Forest simulator for the square ring, $K_{2,3}$, and $K_{3,3}$ graphs and analyze the dependence of the algorithm on the depth of the circuit and initial states. The probability distribution of observation of the feasible states representing maximum independent sets is observed to be asymmetric for the MIS problem, which is unlike the Max-Cut problem where the probability distribution of feasible states is symmetric. For asymmetric graphs it is shown that the algorithm clearly favors the independent set with the larger number of elements even for finite circuit depth. We also compare the approximation ratios for the algorithm when we choose different initial states for the square ring graph and show that it is dependent on the choice of the initial state.

quant-ph↗

arXiv2019

An Experimental Study of Shor's Factoring Algorithm on IBM Q

We study the results of a compiled version of Shor's factoring algorithm on the ibmqx5 superconducting chip, for the particular case of $N=15$, $21$ and $35$. The semi-classical quantum Fourier transform is used to implement the algorithm with only a small number of physical qubits and the circuits are designed to reduce the number of gates to the minimum. We use the square of the statistical overlap to give a quantitative measure of the similarity between the experimentally obtained distribution of phases and the predicted theoretical distribution one for different values of the period. This allows us to assign a period to the experimental data without the use of the continued fraction algorithm. A quantitative estimate of the error in our assignment of the period is then given by the overlap coefficient.

quant-ph↗

arXiv2018

Oscillating Entropy and Spin Precession in the Ensemble of Qubits Interacting with Thermal Systems

We present a simple model which allows us to explain the physical nature of the oscillating entropy. We consider an ensemble of qubits interacting with thermal two-level systems. The entropy of the qubits oscillates between zero and the value of entropy of the thermal systems. We show that the oscillations of the entropy can be clearly explained by the precession of the real or effective spins of the qubits.

quant-ph↗

arXiv2015

Nonlinear Sigma Models with Compact Hyperbolic Target Spaces

We explore the phase structure of nonlinear sigma models with target spaces corresponding to compact quotients of hyperbolic space, focusing on the case of a hyperbolic genus-2 Riemann surface. The continuum theory of these models can be approximated by a lattice spin system which we simulate using Monte Carlo methods. The target space possesses interesting geometric and topological properties which are reflected in novel features of the sigma model. In particular, we observe a topological phase transition at a critical temperature, above which vortices proliferate, reminiscent of the Kosterlitz-Thouless phase transition in the $O(2)$ model. Unlike in the $O(2)$ case, there are many different types of vortices, suggesting a possible analogy to the Hagedorn treatment of statistical mechanics of a proliferating number of hadron species. Below the critical temperature the spins cluster around six special points in the target space known as Weierstrass points. The diversity of compact hyperbolic manifolds suggests that our model is only the simplest example of a broad class of statistical mechanical models whose main features can be understood essentially in geometric terms.

hep-th↗