Recently, a broadcasting multiple blind signature scheme based on quantum teleportation has been proposed for the first time. It is claimed to have unconditional security and properties of quantum multiple signature and quantum blind signature. In this paper, we analyze the security of the protocol and show that the signatory Ui can learn the signed message m by a single particle measurement and the signed message m can be modified at random by anyone according to the scheme. Furthermore, there are some participant attacks and external attacks existing in the scheme. Finally we present an improved protocol and show that the improved scheme can resist all of the mentioned attacks. Meanwhile, the secret keys can be used again and again, which will make it more efficient and practical.
We propose a generalization of quantum teleportation: the so-called many-to-many quantum communication of the information of a d-level system from N spatially separated senders to M>N receivers situated at different locations. We extend the concept of asymmetric telecloning from qubits to d-dimensional systems. We investigate the broadcasting of entanglement by using local 1->2 optimal universal asymmetric Pauli machines and show that the maximal fidelities of the two final entangled states are obtained when symmetric machines are applied. Cloning of entanglement is studied using a nonlocal op…
Blind quantum computation (BQC) is a model in which a computation is performed on a server by a client such that the server is kept blind about the input, the algorithm, and the output of the computation. Here we layout a general framework for BQC which, unlike the previous BQC models, does not constructed on specific computational model. A main ingredient of our construction is gate teleportation. We demonstrate that our framework can be straightforwardly implemented on circuit-based models as well as measurement-based models of quantum computation. We illustrate our construction by showing t…
A broadcasting multiple blind signature scheme based on quantum GHZ entanglement has been presented recently by Tian et al. It is said that the scheme's unconditional security is guaranteed by adopting quantum key preparation, quantum encryption algorithm and quantum entanglement. In this paper, we prove that each signatory can get the signed message just by an intercept-resend attack. Then, we show there still exists some participant attacks and external attacks. Specifically, we verify the message sender Alice can impersonate each signatory to sign the message at will, and so is the signatur…
Blind quantum computation (BQC) allows that a client who has limited quantum abilities can delegate quantum computation to a server who has advanced quantum technologies but learns nothing about the client's private information. However, it still remains a challenge to directly encrypt quantum algorithms in circuits model. To solve the problem, we propose GTUBQC, the first gate teleportation-based universal BQC protocol. In this paper, we consider a scenario where a trusted center is responsible for preparing initial states, a client with the ability to perform X, Z does not require any quantu…
In a previous paper, we showed that many important quantum information-theoretic phenomena, including the no-cloning and no-broadcasting theorems, are in fact generic in all non-classical probabilistic theories. An exception is teleportation, which most such theories do not support. In this paper, we investigate which probabilistic theories, and more particularly, which composite systems, {\em do} support a teleportation protocol. We isolate a natural class of composite systems that we term {\em regular}, and establish necessary and sufficient conditions for a regular tripartite system to supp…
We present a scheme for teleporting an unknown, two-particle entangled state with a message from a sender (Alice) to a receiver (Bob) via a six-particle entangled channel. We also present another scheme for teleporting an unknown one-particle entangled state with a message transmitted in a two-way form between the same sender and receiver via a five-qubit cluster state. One-way hash functions, Bell-state measurements, and unitary operations are adopted in these two schemes. Our schemes use the physical characteristics of quantum mechanics to implement delegation, signature, and verification pr…
We propose a scheme for broadcasting entanglement at a distance based on linear optics. We show that an initial polarization entangled state can be simultaneously split and transmitted to a pair of observers situated at different locations with the help of two conditional Bell-state analyzers based on two beam splitters characterized by the same reflectivity R. In particular for R=1/3 the final states coincide with the output states obtained by the broadcasting protocol proposed by Buzek et al. [Phys. Rev. A 55, 3327 (1997)]. Further we present a different protocol called telecloning of entang…
Quantum telecloning is a multiparty quantum communication protocol which allows quantum information broadcasting. It can be, therefore, seen as a generalization of quantum teleportation. However, in contrast to quantum teleportation, it requires the resource of multipartite entanglement. Here we present an experimental demonstration of universal symmetric 1->2 quantum telecloning of qubits via four-photon polarisation entanglement.
A method is presented for achieving entanglement-free teleportation of a quantum state subject to any quantum noise. We apply this as a light-speed noise-resistant communicator, but also treat the possibility of a quantum ansible, a device for effectively superluminal communication and quantum broadcasting. The results suggest a "no-projector theorem" analogous to the no-cloning theorem. We then show how to build a pseudo-ansible for connection-free light-speed communication.
We present a generalization of quantum teleportation that distributes quantum information from a sender's $d$-level particle to $N_o$ particles held by remote receivers via an initially shared multiparticle entangled state. This entangled state functions as a multiparty quantum information distribution channel between the sender and the receivers. The structure of the distribution channel determines how quantum information is processed. Our generalized teleportation scheme allows multiple receivers at arbitrary locations, and can be used for applications such as optimal quantum information bro…
A way to characterize quantum nonlocality is to see difference in the figure of merit between LOCC optimal protocol and globally optimal protocol in doing certain task, e.g., state estimation, state discrimination, cloning and broadcasting. Especially, we focus on the case where $n$ tensor of unknown states. Our conclusion is that separable pure states are more non-local than entangled pure states. More specifically, the difference in the figure of the merit is exponentially small if the state is entangled, and the exponent is log of the largest Schmidt coefficient. On the other hand, in many …
There are a few obstacles, which bring about imperfect quantum teleportation of a continuous variable state, such as unavailability of maximally entangled two-mode squeezed states, inefficient detection and imperfect unitary transformation at the receiving station. We show that all those obstacles can be understood by a combination of an {\it asymmetrically-decohered} quantum channel and perfect apparatuses for other operations. For the asymmetrically-decohered quantum channel, we find some counter-intuitive results; one is that teleportation does not necessarily get better as the channel is i…
Blind quantum computation allows a user to delegate a computation to an untrusted server while keeping the computation hidden. A number of recent works have sought to establish bounds on the communication requirements necessary to implement blind computation, and a bound based on the no-programming theorem of Nielsen and Chuang has emerged as a natural limiting factor. Here we show that this constraints only hold in limited scenarios and show how to overcome it using a method based on iterated gate-teleportations. We present our results as a family of protocols, with varying degrees of computa…
Generative Adversarial Networks for Resource State Generation
Centre for Quantum Science and Technology, International Institute of Information Technology, Hyderabad（量子科学与技术中心，国际信息技术研究所，海得拉尔）；Center for Security Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad（安全理论与算法研究中心，国际信息技术研究所，海得拉尔）；TCS Research, TATA Consultancy Services, India（TCS研究，塔塔咨询公司，印度）
Quantum computing has seen tremendous progress in the past years. Due to the implementation complexity and cost, the future path of quantum computation is strongly believed to delegate computational tasks to powerful quantum servers on cloud. Universal blind quantum computing (UBQC) provides the protocol for the secure delegation of arbitrary quantum computations, and it has received significant attention. However, a great challenge in UBQC is how to transmit quantum state over long distance securely and reliably. Here, we solve this challenge by proposing and demonstrating a resource-efficien…
Blind quantum computation is an appealing use of quantum information technology because it can conceal both the client's data and the algorithm itself from the server. However, problems need to be solved in the practical use of blind quantum computation and fault-tolerance is a major challenge. On an example circuit, the computational cost measured in T gates executed by the client is 97 times more than performing the original computation directly, without using the server, even before applying error correction. (The client still benefits due to drastically reduced memory requirements.) Broadb…
Verifiable blind quantum computing: Comparative analysis and design considerations for client architectures
QuTech, Delft University of Technology（代尔夫特理工大学 QuTech）；Kavli Institute of Nanoscience, Delft University of Technology（代尔夫特理工大学 卡弗里纳米科学研究所）；Quantum Computer Science, EEMCS, Delft University of Technology（代尔夫特理工大学 EEMCS 量子计算机科学）
Distributed computing is a fastest growing field -- enabling virtual computing, parallel computing, and distributed storage. By exploiting the counterfactual techniques, we devise a distributed blind quantum computation protocol to perform a universal two-qubit controlled unitary operation for any input state without using preshared entanglement and without exchanging physical particles between remote parties. This distributed protocol allows Bob to counterfactully apply an arbitrary unitary operator to Alice's qubit in probabilistic fashion, without revealing the operator to her, using a cont…
Thermofield dynamics (TFD) approach is a real time quantum field method for dealing with finite temperature quantum states in a purified version of usual density operator formalism at finite temperature. In the domain of quantum information, TFD represents a quite promising direction for dealing with qubits under thermal influence and can also be associated to Gaussian states. Here, we propose a generalized TFD mean expectation for the case of thermofield qubits considering the action of gate operators. We propose quantum teleportation protocols involving thermofield states, considering therma…
