Related papers: Certification of a functionality in a quantum netw…

While quantum computers have the potential to perform a wide range of practically important tasks beyond the capabilities of classical computers, realizing this potential remains a challenge. One such task is to use an untrusted remote…

Quantum computers have enabled solving problems beyond the current computers' capabilities. However, this requires handling noise arising from unwanted interactions in these systems. Several protocols have been proposed to address efficient…

With the rapid advancement of quantum information technology, quantum networks have become essential for supporting diverse applications, which often have stringent demands for key metrics such as fidelity and request completion time. In…

This paper presents noise analysis for the two-stage and the three-stage quantum cryptographic protocols based on random polarization rotations. The noise model used is that of uniform distribution of error over a certain small range that…

Randomness certification is a foundational and practical aspect of quantum information science, essential for securing quantum communication protocols. Traditionally, these protocols have been implemented and validated with a single…

The global interest in quantum networks stems from the security guaranteed by the laws of physics. Deploying quantum networks means facing the challenges of scaling up the physical hardware and, more importantly, of scaling up all other…

Correcting errors due to noise in quantum circuits run on current and near-term quantum hardware is essential for any convincing demonstration of quantum advantage. Indeed, in many cases it has been shown that noise renders quantum circuits…

Quantum benchmarks are routinely used to validate the experimental demonstration of quantum information protocols. Many relevant protocols, however, involve an infinite set of input states, of which only a finite subset can be used to test…

We consider generalisations of the dense coding protocol with an arbitrary number of senders and either one or two receivers, sharing a multiparty quantum state, and using a noiseless channel. For the case of a single receiver, the capacity…

Quantum computing comes with the potential to push computational boundaries in various domains including, e.g., cryptography, simulation, optimization, and machine learning. Exploiting the principles of quantum mechanics, new algorithms can…

A token ring is an arrangement of N processors that take turns engaging in an activity which must be controlled. A token confers the right to engage in the controlled activity. Processors communicate with neighbors in the ring to obtain and…

We propose a simple protocol for the verification of quantum computation after the computation has been performed. Our construction can be seen as an improvement on previous results in that it requires only a single prover, who is…

As quantum key distribution becomes increasingly practical, questions of how to effectively employ it in large-scale networks and over large distances becomes increasingly important. To that end, in this work, we model the performance of…

In this paper we introduce a technique and a tool for formal verification of various quantum information processing protocols. The tool uses stabilizer formalism and is capable of representing concurrent quantum protocol, thus is more…

We investigate how the efficiency of the quantum teleportation protocol is affected when the qubits involved in the protocol are subjected to noise or decoherence. We study all types of noise usually encountered in real world…

A quantum network is constructed via maximum entangled coherent states. The possibility of using this network to achieve communication between multi-participants is investigated. We showed that the probability of teleported unknown state…

Secure multi-party computing, also called "secure function evaluation", has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are…

We prove that a quantum circuit together with measurement apparatuses and EPR sources can be fully verified without any reference to some other trusted set of quantum devices. Our main assumption is that the physical system we are working…

Capacitively coupled semiconductor spin qubits hold promise as the building blocks of a scalable quantum computing architecture with long-range coupling between distant qubits. However, the two-qubit gate fidelities achieved in experiments…

The problem of quantum test is formally addressed. The presented method attempts the quantum role of classical test generation and test set reduction methods known from standard binary and analog circuits. QuFault, the authors software…