arXiv subjects

Sreraman Muralidharan

Publications and source records attributed to Sreraman Muralidharan.

At least 19 recordsLinked to original sources

arXiv2025

The simulation of distributed quantum algorithms

Distributed quantum computing (DQC) provides a way to scale quantum computers using multiple quantum processing units (QPU) connected through quantum communication links. In this paper, we have built a distributed quantum computing simulator and used the simulator to investigate quantum algorithms such as the quantum Fourier transform, quantum phase estimation, quantum amplitude estimation, and generation of probability distribution in DQC. The simulator can be used to easily generate and execute distributed quantum circuits, obtain and benchmark DQC parameters such as the fidelity of the algorithm and the number of entanglement generation steps, and use dynamic circuits in a distributed setting to improve results. We show the applicability of dynamic quantum circuits in DQC, where mid-circuit measurements, local operations, and classical communication are used in place of noisy inter-processor (non-local) quantum gates

quant-ph↗

arXiv2021

Foundational Patterns for Efficient Quantum Computing

We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of multiple patterns and algorithms, and show how it can be applied in the context of Quadratic Unconstrained Binary Optimization (QUBO) problems. We start by presenting a visual approach to quantum computing, which avoids a heavy-reliance on quantum mechanics, linear algebra, or complex mathematical notation, and favors geometrical intuition and computing paradigms. We also provide insights on the fundamental quantum computing algorithms (Fourier Transforms, Phase Estimation, Grover, Quantum Counting, and Amplitude Estimation).

quant-ph↗

arXiv2019

Quantum repeaters based on two species trapped ions

We examine the viability of quantum repeaters based on two-species trapped ion modules for long distance quantum key distribution. Repeater nodes comprised of ion-trap modules of co-trapped ions of distinct species are considered. The species used for communication qubits has excellent optical properties while the other longer lived species serves as a memory qubit in the modules. Each module interacts with the network only via single photons emitted by the communication ions. Coherent Coulomb interaction between ions is utilized to transfer quantum information between the communication and memory ions and to achieve entanglement swapping between two memory ions. We describe simple modular quantum repeater architectures realizable with the ion-trap modules and numerically study the dependence of the quantum key distribution rate on various experimental parameters, including coupling efficiency, gate infidelity, operation time and length of the elementary links. Our analysis suggests crucial improvements necessary in a physical implementation for co-trapped two-species ions to be a competitive platform in long-distance quantum communication.

quant-ph↗

arXiv2018

One way quantum repeaters with quantum Reed-Solomon codes

We show that quantum Reed-Solomon codes constructed from classical Reed-Solomon codes can approach the capacity on the quantum erasure channel of $d$-level systems for large dimension $d$. We study the performance of one-way quantum repeaters with these codes and obtain a significant improvement in key generation rate compared to previously investigated encoding schemes with quantum parity codes and quantum polynomial codes. We also compare the three generation of quantum repeaters using quantum Reed-Solomon codes and identify parameter regimes where each generation performs the best.

quant-ph↗

arXiv2017

Overcoming erasure errors with multilevel systems

We investigate the usage of highly efficient error correcting codes of multilevel systems to protect encoded quantum information from erasure errors and implementation to repetitively correct these errors. Our scheme makes use of quantum polynomial codes to encode quantum information and generalizes teleportation based error correction for multilevel systems to correct photon losses and operation errors in a fault-tolerant manner. We discuss the application of quantum polynomial codes to one-way quantum repeaters. For various types of operation errors, we identify different parameter regions where quantum polynomial codes can achieve a superior performance compared to qubit based quantum parity codes.

quant-ph↗

arXiv2016

Cat codes with optimal decoherence suppression for a lossy bosonic channel

We investigate cat codes that can correct multiple excitation losses and identify two types of logical errors: bit-flip errors due to excessive excitation loss and dephasing errors due to quantum back-action from the environment. We show that selected choices of logical subspace and coherent amplitude can efficiently reduce dephasing errors. The trade-off between the two major errors enables optimized performance of cat codes in terms of minimized decoherence. With high coupling efficiency, we show that one-way quantum repeaters with cat codes feature drastically boosted secure communication rate per mode compared with conventional encoding schemes, and thus showcase the promising potential of quantum information processing with continuous variable quantum codes.

quant-ph↗

arXiv2015

Efficient long distance quantum communication

Despite the tremendous progress of quantum cryptography, efficient quantum communication over long distances (>1000km) remains an outstanding challenge due to fiber attenuation and operation errors accumulated over the entire communication distance. Quantum repeaters, as a promising approach, can overcome both photon loss and operation errors, and hence significantly speedup the communication rate. Depending on the methods used to correct loss and operation errors, all the proposed QR schemes can be classified into three categories (generations). Here we present the first systematic comparison of three generations of quantum repeaters by evaluating the cost of both temporal and physical resources, and identify the optimized quantum repeater architecture for a given set of experimental parameters. Our work provides a roadmap for the experimental realizations of highly efficient quantum networks over transcontinental distances.

quant-ph↗

arXiv2014

Ultrafast and Fault-Tolerant Quantum Communication across Long Distances

Quantum repeaters (QRs) provide a way of enabling long distance quantum communication by establishing entangled qubits between remote locations. We investigate a new approach to QRs in which quantum information can be faithfully transmitted via a noisy channel without the use of long distance teleportation, thus eliminating the need to establish remote entangled links. Our approach makes use of small encoding blocks to fault-tolerantly correct both operational and photon loss errors. We describe a way to optimize the resource requirement for these QRs with the aim of the generation of a secure key. Numerical calculations indicate that the number of quantum memory bits required for our scheme has favorable poly-logarithmic scaling with the distance across which the communication is desired.

quant-ph↗

arXiv2011

In how many ways can quantum information be split ?

We establish a theoretical understanding of the entanglement properties of a physical system that mediates a quantum information splitting protocol. We quantify the different ways in which an arbitrary $n$ qubit state can be split among a set of $k$ participants using a $N$ qubit entangled channel, such that the original information can be completely reconstructed only if all the participants cooperate. Based on this quantification, we show how to design a quantum protocol with minimal resources and define the splitting efficiency of a quantum channel which provides a way of characterizing entangled states based on their usefulness for such quantum networking protocols.

quant-ph↗

arXiv2010

$2N$ qubit "mirror states" for optimal quantum communication

We introduce a new genuinely 2N qubit state, known as the "mirror state" with interesting entanglement properties. The well known Bell and the cluster states form a special case of these "mirror states", for N=1 and N=2 respectively. It can be experimentally realized using $SWAP$ and multiply controlled phase shift operations. After establishing the general conditions for a state to be useful for various communicational protocols involving quantum and classical information, it is shown that the present state can optimally implement algorithms for the quantum teleportation of an arbitrary N qubit state and achieve quantum information splitting in all possible ways. With regard to superdense coding, one can send 2N classical bits by sending only N qubits and consuming N ebits of entanglement. Explicit comparison of the mirror state with the rearranged N Bell pairs and the linear cluster states is considered for these quantum protocols. We also show that mirror states are more robust than the rearranged Bell pairs with respect to a certain class of collisional decoherence.

quant-ph↗

arXiv2010

Splitting of quantum information using N-qubit linear cluster states

We provide a number of schemes for the splitting up of quantum information among $k$ parties using a $N$-qubit linear cluster state as a quantum channel, such that the original information can be reconstructed only if all the parties cooperate. Explicit circuits are provided for these schemes, which are based on the concept of measurement based locking and unlocking of quantum information. These are experimentally feasible as they require measurements to be performed only on product basis.

quant-ph↗

arXiv2009

Multipartite entangled magnon states as quantum communication channels

We explicate conditions under which, the two magnon state becomes highly entangled and is useful for several quantum communication protocols. This state, which is experimentally realizable in quantum dots using Heisenberg exchange interaction, is found to be suitable for carrying out deterministic teleportation of an arbitrary two qubit composite system. Further, conditions for which the channel capacity reaches "Holevo bound", allowing maximal amount of classical information to be encoded, are derived. Later, an explicit protocol for the splitting and sharing of a two qubit entangled state among two parties, using this state as an entangled resource, is demonstrated.

quant-ph↗

arXiv2009

Secure quantum conversation through non-destructive discrimination of highly entangled multipartite states

"Quantum conversation" is a way in which two parties can communicate classical information with each other using entanglement as a shared resource. We present this scheme using a multipartite entangled state after describing its generation through appropriate circuit diagrams. We make use of a discrimination scheme which allows one to perform a measurement on the system without destroying its entanglement. We later prove that this scheme is secure in a noiseless and a lossless quantum channel.

quant-ph↗

arXiv2009

Quantum tasks using six qubit cluster states

The usefulness of the recent experimentally realized six photon cluster state by C. Y. Lu et al. (2007, Nature {3} {91}), is investigated for quantum communication protocols like teleportation, quantum information splitting (QIS), remote state preparation and dense coding. We show that the present state can be used for the teleportation of an arbitrary two qubit state deterministically. Later we devise two distinct protocols for the QIS of an arbitrary two qubit state among two parties and systematically compare their relative merits in terms of classical communication and security. Sixteen orthogonal measurement basis on the cluster state is constructed, which will lock an arbitrary two qubit state among two parties. The usefulness of the state for dense coding is investigated and it is shown that one can send five classical bits by sending only three qubits using this state as a shared entangled resource. We finally show that this state can also be utilised in the remote state preparation of an arbitrary two qubit state.

quant-ph↗

arXiv2009

Non-destructive discrimination of multiparticle cluster states for quantum computation

Discriminating between orthogonal quantum systems without destroying their entanglement is of interest to quantum computation and communication. In this paper, we explicate the schemes for the non-destructive discrimination (NDD) of 16 orthogonal four qubit cluster states and 32 orthogonal five qubit cluster states respectively. This technique will find its applications in various branches of quantum information theory.

quant-ph↗

arXiv2008

Quantum teleportation and state sharing using a genuinely entangled six qubit state

The usefulness of the genuinely entangled six qubit state that was recently introduced by Borras et al. is investigated for the quantum teleportation of an arbitrary three qubit state and for quantum state sharing (QSTS) of an arbitrary two qubit state. For QSTS, we explicitly devise two protocols and construct sixteen orthogonal measurement basis which can lock an arbitrary two qubit information between two parties.

quant-ph↗

arXiv2008

Quantum information splitting using multi-partite cluster states

We provide various schemes for the splitting up of Quantum information into parts using the four and five partite cluster states. Explicit protocols for the Quantum information splitting (QIS) of single and two qubit states are illustrated. It is found that the four partite cluster state can be used for the QIS of an entangled state and the five partite cluster state can be used for QIS of an arbitrary two qubit state. The schemes considered here are also secure against certain eavesdropping attacks.

quant-ph↗

arXiv2008

Minimal classical communication and measurement complexity for quantum information splitting of a two qubit state

We provide explicit schemes for quantum information splitting (QIS) of real or equatorial two qubit states among two parties, through the five particle cluster and Brown states respectively. The schemes introduced are neither fully deterministic nor completely probabilistic and are carried out in the case where, the information that is to be shared is partially or fully known to the sender. We show that, QIS can be accomplished with just two classical bits, as against four classical bits, when the information is unknown to the sender.

quant-ph↗