Related papers: Comment on "Fault-Tolerate Quantum Private Compari…
Quantum algorithms can break factoring and discrete logarithm based cryptography and weaken symmetric cryptography and hash functions. In order to estimate the real-world impact of these attacks, apart from tracking the development of…
Quantum computers face significant challenges from quantum deviations or coherent noise, particularly during gate operations, which pose a complex threat to the efficacy of quantum error correction (QEC) protocols. In this study, we…
Quantum cryptographic conferencing (QCC) holds promise for distributing information-theoretic secure keys among multiple users over long distance. Limited by the fragility of Greenberger-Horne-Zeilinger (GHZ) state, QCC networks based on…
In the current work we address the problem of quantum process tomography (QPT) in the case of imperfect preparation and measurement of the states which are used for QPT. The fuzzy measurements approach which helps us to efficiently take…
We present a fault-tolerant universal gate set consisting of Hadamard and controlled-controlled-Z (CCZ) on Bacon-Shor subsystem codes. Transversal non-Clifford gates on these codes are intriguing in that higher levels of the Clifford…
Even in the absence of external influences the operability of a quantum computer (QC) is not guaranteed because of the effects of residual one- and two-body imperfections. Here we investigate how these internal flaws affect the performance…
In quantum cryptosystems, variations in detector efficiency can be exploited to stage a successful attack. This happens when the efficiencies of Bob's two detectors are different functions of a control parameter accessible to Eve (e.g.,…
A multiparty quantum secret report scheme is proposed with quantum encryption. The boss Alice and her $M$ agents first share a sequence of ($M$+1)-particle Greenberger--Horne--Zeilinger (GHZ) states that only Alice knows which state each…
As quantum computers become available through multi-tenant cloud platforms, ensuring privacy against adversaries sharing the same quantum processing unit becomes critical. We introduce and explore \emph{covert quantum computing}, a new…
We study the use of triorthogonal codes for universal fault-tolerant quantum computation and propose two methods to circumvent the Eastin-Knill theorem, which prohibits any single quantum error-correcting code from supporting both…
Fault-tolerant quantum computation is a technique that is necessary to build a scalable quantum computer from noisy physical building blocks. Key for the implementation of fault-tolerant computations is the ability to perform a universal…
We exhibit a simple, systematic procedure for detecting and correcting errors using any of the recently reported quantum error-correcting codes. The procedure is shown explicitly for a code in which one qubit is mapped into five. The…
Utilizing the advantage of quantum entanglement swapping, a multi-party quantum key agreement protocol with authentication is proposed. In this protocol, a semi-trusted third party is introduced, who prepares Bell states, and sends one…
Scalable quantum computing can only be achieved if qubits are manipulated fault-tolerantly. Topological error correction - a novel method which combines topological quantum computing and quantum error correction - possesses the highest…
In this paper, a novel hybrid protocol for semiquantum key distribution (SQKD) and semiquantum secret sharing (SQSS) was constructed by using GHZ-like states. This protocol is capable of establishing two different private keys between one…
Recently, Younes et al. proposed an efficient multi-party semi-quantum secret sharing (SQSS) scheme that generalizes Tian et al.'s three-party protocol \cite{Tian2021} to accommodate multiple participants. This scheme retains the original…
Bosonic encodings of quantum information offer hardware-efficient, noise-biased approaches to quantum error correction relative to qubit register encodings. Implementations have focused in particular on error correction of stored, idle…
Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. We show how this procedure can be implemented using GHZ states. In the quantum…
Experimental Quantum Key Distribution (QKD) protocols have to consist of not only the unconditionally secure quantum transmission, but also a subsequent classical exchange that enables key reconciliation and error correction. There is a…
Quantum Key Distribution (QKD) leverages the principles of quantum mechanics to exchange a secret key between two parties. Unlike classical cryptographic systems, the security of QKD is not reliant on computational assumptions but is…