MFMuhammad Faryad

Muhammad Faryad

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Muhammad Faryad has a total of 66 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Gate teleportation using noisy gates

    by Imama Tul Birrah Khan, Muhammad Faryad

  • Analysis of state teleportation using noisy quantum gates

    by Imama Tul Birrah Khan, Muhammad Faryad

    Noise is a major challenge in quantum computing, affecting the reliability of quantum protocols. In this work, we analytically study the impact of various noise processes, such as depolarization, bit flip and phase flip, on the quantum state teleportation protocol. Each noise process is modeled as a quantum channel and is applied individually to all qubits after the corresponding unitary operations to simulate realistic conditions. We evaluate the fidelity between the ideal and noisy teleported states to quantify the effect of noise. Our analysis shows that the fidelity decreases polynomially, in general, as the noise strength increases for all noise types, highlighting the sensitivity of state teleportation to different noise mechanisms. However, in the low noise regime, the fidelity decreases only linearly, indicating the robustness of the teleportation protocol. These results provide insight into error characterization and can inform strategies for noise mitigation in practical quantum computing applications.

  • Open Access

    Geometric Parameterization of Kraus Operators with Applications to Quasi Inverse Channels for Multi Qubit Systems

    by Zain Ateeq, Muhammad Faryad

    This work presents a differentiable geometric parameterization of quantum channels in Kraus representation, which can be efficiently probed to find an unknown quantum channel. We explore its feasibility in finding the quasi inverse channels, which can be a tedious analytically for complex noise processes and is often achievable only for a limited range of parameters. In this regard, machine learning based algorithms have been employed successfully to find quasi inverse of quantum channels. The space of quantum channels in this scheme is a unit hypersphere, and components of mutually constrained unit vectors residing in this space, are used to construct a physically valid quantum channel. Symplectic constraints, orthogonality, and unit length of the vectors suffice to maintain complete positivity and the trace-preserving property of the channels. By performing gradient descent on this parametric space with a fidelity-based loss function, this approach is found to optimize quasi inverse of a variety of quantum channels, not limited to single-qubits, proving its effectiveness.

  • Open Access

    Lecture Notes on Quantum Algorithms

    by Muhammad Faryad

    These notes begin in Chapter 1 with a review of linear algebra and the postulates of quantum mechanics, leading to an explanation of single- and multi-qubit gates. Chapter 2 explores the challenge of constructing arbitrary quantum states from given initial states, and introduces circuits for building oracles. Chapter 3 presents foundational algorithms such as entanglement creation, quantum teleportation, Deutsch-Jozsa, Bernstein-Vazirani, and Simon's algorithm. Chapters 4 and 5 cover algorithms based on the quantum Fourier transform, including phase estimation, period finding, factoring, and logarithm computation. These chapters also include complexity analysis and detailed quantum circuits suitable for implementation in code. Chapter 6 introduces Grover's algorithm for quantum search and amplitude amplification, including its realization via Hamiltonian simulation and a method for derandomization. Chapter 7 discusses basic techniques for Hamiltonian simulation, such as Lie-Trotter decomposition, sparse Hamiltonians, and the linear combination of unitaries. It also provides example circuits for simulating Hamiltonians expressed as linear combinations of Pauli operators. Chapter 8 introduces variational quantum algorithms, and Chapter 9 presents an algorithm for simulating fermionic many-particle systems, with an emphasis on molecular Hamiltonians. It also outlines the key transformations needed to map a molecular Hamiltonian to a form suitable for simulation on a quantum computer.

  • Quasi-inverse of qubit channels for mixed states

    by Muhammad Faizan, Muhammad Faryad

  • Maximal visualization-enhancement of latent fingermarks on polymer banknotes using columnar thin films

    by Muhammad Faryad, Abdul Rehman, Partha P. Banerjee, Akhlesh Lakhtakia

    Polymer banknotes are being increasingly adopted to replace older banknotes. Since banknotes are forensically important substrates for fingermark detection and identification, we present a single-step process to enhance the visualization of fingermarks on banknotes using 40-nm-thick columnar thin films (CTFs) of nickel. This singlestep vacuum technique enhances the quality grade of fingermarks maximally, whether the fingermarks are aged for one or seven days before CTF deposition. This work represents progress over currently available sequences of diverse techniques for enhancing fingermarks on polymer banknotes.

  • Transport of intensity and phase: applications to digital holography [Invited]

    by Nouf A. Alanazi, Austin M. Scott, Hammid Al-Ghezi, Muhammad Faryad, Akhlesh Lakhtakia, Partha P. Banerjee

    We first review transport of intensity and phase and show their use as a convenient tool to directly determine the unwrapped phase of an imaged object, either through conventional imaging or using digital holography. For both cases, either the traditional transport of intensity and phase, or with a modification, viz., electrically controllable transport of intensity and phase, can be used. The use of digital holography with transport of intensity for 3D topographic mapping of fingermarks coated with columnar thin films is shown as an illustrative application of this versatile technique.


  • Simulation and analysis of quantum phase estimation algorithm in the presence of incoherent quantum noise channels

    by Muhammad Faryad

    The quantum phase estimation (QPE) is one of the fundamental algorithms based on the quantum Fourier transform. It has applications in order-finding, factoring, and finding the eigenvalues of unitary operators. The major challenge in running QPE and other quantum algorithms is the noise in quantum computers. In the present work, we study the impact of incoherent noise on QPE, modeled as trace-preserving and completely positive quantum channels. Different noise models such as depolarizing, phase flip, bit flip, and bit-phase flip are taken to understand the performance of the QPE in the presence of noise. The simulation results indicate that the standard deviation of the eigenvalue of the unitary operator has strong exponential dependence upon the error probability of individual qubits. However, the standard deviation increases only linearly with the number of qubits for fixed error probability when that error probability is small.

  • Open Access

    Simulation and analysis of quantum phase estimation algorithm in the presence of incoherent quantum noise channels

    by Muhammad Faizan, Muhammad Faryad

    The quantum phase estimation (QPE) is one of the fundamental algorithms based on the quantum Fourier transform. It has applications in order-finding, factoring, and finding the eigenvalues of unitary operators. The major challenge in running QPE and other quantum algorithms is the noise in quantum computers. In the present work, we study the impact of incoherent noise on QPE, modeled as trace-preserving and completely positive quantum channels. Different noise models such as depolarizing, phase flip, bit flip, and bit-phase flip are taken to understand the performance of the QPE in the presence of noise. The simulation results indicate that the standard deviation of the eigenvalue of the unitary operator has strong exponential dependence upon the error probability of individual qubits. However, the standard deviation increases only linearly with the number of qubits for fixed error probability when that error probability is small.