19 September 2019 in Scientific Reports
Measurement-based quantum computing is one of the most promising quantum computing models. Although various universal resource states have been proposed so far, it was open whether only two Pauli bases are enough for both of universal measurement-based quantum computing and its verification. In this paper, we construct a universal hypergraph state that only requires X and Z-basis measurements for universal measurement-based quantum computing. We also show that universal measurement-based quantum computing on our hypergraph state can be verified in polynomial time using only X and Z-basis measurements. Furthermore, in order to demonstrate an advantage of our hypergraph state, we construct a verifiable blind quantum computing protocol that requires only X and Z-basis measurements for the client.
12 April 2019 in npj Quantum Information
Verifying quantum states is central to certifying the correct operation of various quantum information processing tasks. In particular, in measurement-based quantum computing, checking whether correct graph states are generated is essential for reliable quantum computing. Several verification protocols for graph states have been proposed, but none of these are particularly resource efficient: multiple copies are required to extract a single state that is guaranteed to be close to the ideal one. The best protocol currently known requires O(n15) copies of the state, where n is the size of the graph state. In this paper, we construct a significantly more resource-efficient verification protocol for graph states that only requires O(n5 log n) copies. The key idea is to employ Serfling’s bound, which is a probability inequality in classical statistics. Utilizing Serfling’s bound also enables us to generalize our protocol for qudit and continuous-variable graph states. Constructing a resource-efficient verification protocol for them is non-trivial. For example, the previous verification protocols for qubit graph states that use the quantum de Finetti theorem cannot be generalized to qudit and continuous-variable graph states without tremendously increasing the resource overhead. This is because the overhead caused by the quantum de Finetti theorem depends on the local dimension. On the other hand, in our protocol, the resource overhead is independent of the local dimension, and therefore generalizing to qudit or continuous-variable graph states does not increase the overhead. The flexibility of Serfling’s bound also makes our protocol robust: our protocol accepts slightly noisy but still useful graph states.
21 February 2019 in Physical Review A
Typically, the aim of quantum metrology is to sense target fields with high precision utilizing quantum properties. Unlike the typical aim, in this paper, we use quantum properties for adding a functionality to quantum sensors. More concretely, we propose a delegated quantum sensor (a client-server model) with security inbuilt. Suppose that a client wants to measure some target fields with high precision, but he/she does not have any high-precision sensor. This leads the client to delegate the sensing to a remote server who possesses a high-precision sensor. The client gives the server instructions about how to control the sensor. The server lets the sensor interact with the target fields in accordance with the instructions, and then sends the sensing measurement results to the client. In this case, since the server knows the control process and readout results of the sensor, the information of the target fields is available not only for the client but also for the server. We show that, by using an entanglement between the client and the server, an asymmetric information gain is possible so that only the client can obtain sufficient information on the target fields. In our scheme, the server generates the entanglement between a solid-state system (that can interact with the target fields) and a photon, and sends the photon to the client. On the other hand, the client is required to possess linear-optics elements only including wave plates, polarizing beam splitters, and single-photon detectors. Our scheme is feasible with the current technology, and our results pave the way for an application of quantum metrology.
22 July 2020 in Physical Review Applied
Quantum metrology aims to enhance the precision of various measurement tasks by taking advantages of quantum properties. In many scenarios, precision is not the sole target; the acquired information must be protected once it is generated in the sensing process. Considering a remote sensing scenario where a local site performs cooperative sensing with a remote site to collect sensitive information at the remote site, the loss of sensing data inevitably causes sensitive information to be revealed. Quantum key distribution is known to be a reliable solution for secure data transmission; however, it fails if an eavesdropper accesses the sensing data generated at a remote site. In this study we demonstrate that, by sharing entanglement between local and remote sites, secure quantum remote sensing can be realized, and the secure level is characterized by asymmetric Fisher information gain. Concretely, only the local site can acquire the estimated parameter accurately with Fisher information approaching 1. In contrast, the accessible Fisher information for an eavesdropper is nearly zero even if he or she obtains the raw sensing data at the remote site. This achievement is primarily due to the nonlocal calibration and control of the probe state at the remote site. Our results explore one significant advantage of “quantumness” and extend the notion of quantum metrology to the security realm.
3 February 2022 in Physical Review A
Variational quantum algorithms (VQAs) have been considered to be useful applications of noisy intermediate-scale quantum (NISQ) devices. Typically, in VQAs, a parametrized ansatz circuit is used to generate a trial wave function, and the parameters are optimized to minimize a cost function. On the other hand, blind quantum computing (BQC) has been studied in order to provide a quantum algorithm with security by using cloud networks. A client with a limited ability to perform quantum operations hopes to have access to a quantum computer of a server, and BQC allows the client to use the server's computer without leakage of the client's information (such as input, running quantum algorithms, and output) to the server. However, BQC is designed for fault-tolerant quantum computing, and this requires many ancillary qubits, which may not be suitable for NISQ devices. Here, we propose an efficient way to implement the NISQ computing with guaranteed security for the client. In our architecture, only qubits are required, under an assumption that the form of ansätze is known to the server, where denotes the necessary number of the qubits in the original NISQ algorithms. The client only performs single-qubit measurements on an ancillary qubit sent from the server, and the measurement angles can specify the parameters for the ansätze of the NISQ algorithms. The no-signaling principle guarantees that neither parameters chosen by the client nor the outputs of the algorithm are leaked to the server. This work paves the way for new applications of NISQ devices.