SearcharxivSearch

arXiv subjects

Shahram Babaie

Publications and source records attributed to Shahram Babaie.

5 recordsLinked to original sources

Need One Bell-pair Only (NOBOL) for Low-Overhead Fault-Tolerant Quantum Computing

Fault-tolerant quantum computation fundamentally relies on encoding a logical qubit into a structured block of physical qubits, typically in the tens to hundreds. As a trade-off for improved fault-tolerance, logical gate operations will incur a linear overhead in terms of both the amount of time and quantum resources than before. For example, in monolithic quantum computing, performing a gate operation on two distant logical qubits will first require using a linear number of SWAP operations in order to move the logical qubits next to each other; while in distributed quantum computing, doing so will first require a linear number of ancilla qubits in order to form entanglement connections (or a logical Bell pair). In this paper, we focus on significantly reducing the overhead involved in logical CNOT operations, a fundamental primitive. We propose NOBOL, a novel approach that requires only one Bell pair to perform a logical CNOT operation on two distant qubits encoded in arbitrary CSS codes. More importantly, NOBOL only requires performing gate operations on the logical X or Z operator subsets of the logical qubits. For many CSS codes, such as the surface code, these subsets are significantly smaller than the size of the code itself. In this paper, we describe various circuit realizations of NOBOL, including a depth-optimal circuit with logarithmic depth in terms of the size of the logical operators. Finally, we propose effective methods to contain error propagation without incurring much additional overhead. Since NOBOL can be effectively applied to a wide range of quantum error-correcting (QEC) codes and, in addition, is agnostic to qubit modalities and effective for various architectures, including those based on either a monolithic QPU or distributed QPUs.

quant-ph

Towards Distributed Quantum Error Correction for Distributed Quantum Computing

Quantum computing as a promising technology can utilize stochastic solutions instead of deterministic approaches for complicated scenarios for which classical computing is inefficient, provided that both the concerns of the error-prone nature of qubits and the limitation of the number of qubits are addressed carefully. In order to address both concerns, a new qubit-based Distributed Quantum Error Correction (DQEC) architecture is proposed in which three physical qubits residing on three Quantum Processing Units (QPU) are used to form a logical qubit. This paper illustrates how three QPUs collaboratively generate a joint quantum state in which single bit-flip and phase-flip errors can be properly resolved. By reducing the number of qubits required to form a logical qubit in the proposed architecture, each QPU with its limited number of physical qubits can accommodate more logical qubits than when it has to devote its three physical qubits for each logical qubit. The functional correctness of the proposed architecture is evaluated through the Qiskit tool and stabilizer generators. Moreover, the fidelity of input and output quantum states, the complexity of the proposed designs, and the dependency between error probability and correctness of the proposed architecture are analyzed to prove its effectiveness.

quant-ph

Hole Detection for Increasing Coverage in Wireless Sensor Network Using Triangular Structure

The emerging technology of wireless sensor network (WSN) is expected to provide a broad range of applications, such as battlefield surveillance, environmental monitoring, smart spaces and so on. The coverage problem is a fundamental issue in WSN, which mainly concerns with a fundamental question: How well a sensor field is observed by the deployed sensors? Mobility is exploited to improve area coverage in a kind of hybrid sensor networks. The main objective for using mobile sensor nodes is to heal coverage holes after the initial network deployment, when designing a hole healing algorithm, the following issues need to be addressed. First, how to decide the existence of a coverage hole and how to estimate the size of a hole. Second, what are the best target locations to relocate mobile nodes to repair coverage holes? We use the triangular oriented diagram (HSTT) for aim to goal where its simple, have low calculation among construction and it is great to calculate the size of hole exactly .

cs.NI

Reliable Communication in Wireless Body Area Sensor Network for Health Monitoring

Now days, interests in the application of Wireless Body Area Network (WBAN) have grown considerably. A number of tiny wireless sensors, strategically placed on the human body, create a wireless body area network that can monitor various vital signs, providing real-time feedback to the user and medical personnel. This communication needs to be energy efficient and highly reliable while keeping delays low. In this paper we present hardware and software architecture for BAN and also we offer reliable communication and data aggregation.

cs.NI

New clustering method to decrease probability of failure nodes and increasing the lifetime in WSNs

Clustering in wireless sensor networks is one of the crucial methods for increasing of network lifetime. There are many algorithms for clustering. One of the important cluster based algorithm in wireless sensor networks is LEACH algorithm. In this paper we proposed a new clustering method for increasing of network lifetime. We distribute several sensors with a high-energy for managing the cluster head and to decrease their responsibilities in network. The performance of the proposed algorithm via computer simulation was evaluated and compared with other clustering algorithms. The simulation results show the high performance of the proposed clustering algorithm.

cs.OH