Siga este enlace para ver otros tipos de publicaciones sobre el tema: Delegated quantum computing.
Artículos de revistas sobre el tema "Delegated quantum computing"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 20 mejores artículos de revistas para su investigación sobre el tema "Delegated quantum computing".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
1
Morimae, Tomoyuki y Takeshi Koshiba. "Impossibility of perfectly-secure one-round delegated quantum computing for classical client". Quantum Information and Computation 19, n.º 3&4 (marzo de 2019): 214–21. http://dx.doi.org/10.26421/qic19.3-4-2.
Texto completoResumen
Blind quantum computing protocols enable a client, who can generate or measure single-qubit states, to delegate quantum computing to a remote quantum server protecting the client's privacy (i.e., input, output, and program). With current technologies, generations or measurements of single-qubit states are not too much burden for the client. In other words, secure delegated quantum computing is possible for ``almost classical" clients. However, is it possible for a ``completely classical" client? Here we consider a one-round perfectly-secure delegated quantum computing, and show that the protocol cannot satisfy both the correctness (i.e., the correct result is obtained when the server is honest) and the perfect blindness (i.e., the client's privacy is completely protected) simultaneously unless BQP is in NP. Since BQP is not believed to be in NP, the result suggests the impossibility of the one-round perfectly-secure delegated quantum computing.
2
Kashefi, Elham y Anna Pappa. "Multiparty Delegated Quantum Computing". Cryptography 1, n.º 2 (30 de julio de 2017): 12. http://dx.doi.org/10.3390/cryptography1020012.
Texto completo
3
Liu, Zhixin, Qiaoling Xie, Yongfu Zha y Yumin Dong. "Quantum delegated computing ciphertext retrieval scheme". Journal of Applied Physics 131, n.º 4 (31 de enero de 2022): 044401. http://dx.doi.org/10.1063/5.0080097.
Texto completo
4
Morimae, Tomoyuki y Harumichi Harumichi Nishimura. "Rational proofs for quantum computing". Quantum Information and Computation 20, n.º 3&4 (marzo de 2020): 181–93. http://dx.doi.org/10.26421/qic20.3-4-1.
Texto completoResumen
It is an open problem whether a classical client can delegate quantum computing to an efficient remote quantum server in such a way that the correctness of quantum computing is somehow guaranteed. Several protocols for verifiable delegated quantum computing have been proposed, but the client is not completely free from any quantum technology: the client has to generate or measure single-qubit states. In this paper, we show that the client can be completely classical if the server is rational (i.e., economically motivated), following the ``rational proofs" framework of Azar and Micali. More precisely, we consider the following protocol. The server first sends the client a message allegedly equal to the solution of the problem that the client wants to solve. The client then gives the server a monetary reward whose amount is calculated in classical probabilistic polynomial-time by using the server's message as an input. The reward function is constructed in such a way that the expectation value of the reward (the expectation over the client's probabilistic computing) is maximum when the server's message is the correct solution to the problem. The rational server who wants to maximize his/her profit therefore has to send the correct solution to the client.
5
Sun, Wenli, Yan Chang, Danchen Wang, Shibin Zhang y Lili Yan. "Delegated quantum neural networks for encrypted data". Physica Scripta 99, n.º 5 (29 de marzo de 2024): 055102. http://dx.doi.org/10.1088/1402-4896/ad348f.
Texto completoResumen
Abstract Quantum machine learning is expected to utilize the potential advantages of quantum computing to advance the efficiency of machine learning. However, with the help of quantum cloud servers, ordinary users may confront the threat of privacy leakage of input data and models when performing the training or inference of quantum neural networks (QNNs). To address this problem, we present a new framework that allows the training and inference of delegated QNNs to be performed on encrypted data to protect the privacy of users’ data and models. This framework contains two models that are alternately trained: an encryptor and a predictor. The classical client first trains the encryptor defined by a classical neural network to map plaintext input data to vastly different ciphertext data. The ciphertext data is sent to the quantum cloud server to train the predictor defined by a QNN, which can indirectly predict the labels of plaintext data. With the trained encryptor and predictor, the client can send the encrypted data to the server for prediction and obtain almost equivalent prediction results. The proposed framework is applied to three types of QNN models, each dealing with low-dimensional tabular data, image data, and one-dimensional time series data, respectively. Experimental results show that the privacy protection method based on our framework can protect data and model privacy without degrading the performance of QNNs. The framework does not require users to have quantum capabilities and is suitable for protecting data and model privacy for various QNN models.
6
Doosti, Mina, Niraj Kumar, Mahshid Delavar y Elham Kashefi. "Client-server Identification Protocols with Quantum PUF". ACM Transactions on Quantum Computing 2, n.º 3 (30 de septiembre de 2021): 1–40. http://dx.doi.org/10.1145/3484197.
Texto completoResumen
Recently, major progress has been made towards the realisation of quantum internet to enable a broad range of classically intractable applications. These applications such as delegated quantum computation require running a secure identification protocol between a low-resource and a high-resource party to provide secure communication. In this work, we propose two identification protocols based on the emerging hardware-secure solutions, the quantum Physical Unclonable Functions (qPUFs). The first protocol allows a low-resource party to prove its identity to a high-resource party and in the second protocol, it is vice versa. Unlike existing identification protocols based on Quantum Read-out PUFs that rely on the security against a specific family of attacks, our protocols provide provable exponential security against any Quantum Polynomial-Time adversary with resource-efficient parties. We provide a comprehensive comparison between the two proposed protocols in terms of resources such as quantum memory and computing ability required in both parties as well as the communication overhead between them.
7
Morimae, Tomoyuki, Harumichi Nishimura, Yuki Takeuch y Seiichiro Tani. "Impossibility of blind quantum sampling for classical client". quantum Information and Computation 19, n.º 9&10 (septiembre de 2019): 793–806. http://dx.doi.org/10.26421/qic19.9-10-3.
Texto completoResumen
Blind quantum computing enables a client, who can only generate or measure single-qubit states, to delegate quantum computing to a remote quantum server in such a way that the input, output, and program are hidden from the server. It is an open problem whether a completely classical client can delegate quantum computing blindly (in the information theoretic sense). In this paper, we show that if a completely classical client can blindly delegate sampling of subuniversal models, such as the DQC1 model and the IQP model, then the polynomial-time hierarchy collapses to the third level. Our delegation protocol is the one where the client first sends a polynomial-length bit string to the server and then the server returns a single bit to the client. Generalizing the no-go result to more general setups is an open problem.
8
Morimae, Tomoyuki. "Secure Cloud Quantum Computing with Verification Based on Quantum Interactive Proof". Impact 2019, n.º 10 (30 de diciembre de 2019): 30–32. http://dx.doi.org/10.21820/23987073.2019.10.30.
Texto completoResumen
In cloud quantum computing, a classical client delegate quantum computing to a remote quantum server. An important property of cloud quantum computing is the verifiability: the client can check the integrity of the server. Whether such a classical verification of quantum computing is possible or not is one of the most important open problems in quantum computing. We tackle this problem from the view point of quantum interactive proof systems. Dr Tomoyuki Morimae is part of the Quantum Information Group at the Yukawa Institute for Theoretical Physics at Kyoto University, Japan. He leads a team which is concerned with two main research subjects: quantum supremacy and the verification of quantum computing.
9
Efthymiou, Stavros, Alvaro Orgaz-Fuertes, Rodolfo Carobene, Juan Cereijo, Andrea Pasquale, Sergi Ramos-Calderer, Simone Bordoni et al. "Qibolab: an open-source hybrid quantum operating system". Quantum 8 (12 de febrero de 2024): 1247. http://dx.doi.org/10.22331/q-2024-02-12-1247.
Texto completoResumen
We present Qibolab, an open-source software library for quantum hardware control integrated with the Qibo quantum computing middleware framework. Qibolab provides the software layer required to automatically execute circuit-based algorithms on custom self-hosted quantum hardware platforms. We introduce a set of objects designed to provide programmatic access to quantum control through pulses-oriented drivers for instruments, transpilers and optimization algorithms. Qibolab enables experimentalists and developers to delegate all complex aspects of hardware implementation to the library so they can standardize the deployment of quantum computing algorithms in a extensible hardware-agnostic way, using superconducting qubits as the first officially supported quantum technology. We first describe the status of all components of the library, then we show examples of control setup for superconducting qubits platforms. Finally, we present successful application results related to circuit-based algorithms.
10
Morimae, Tomoyuki, Vedran Dunjko y Elham Kashefi. "Ground state blind quantum computation on AKLT state". Quantum Information and Computation 15, n.º 3&4 (marzo de 2015): 200–234. http://dx.doi.org/10.26421/qic15.3-4-2.
Texto completoResumen
The blind quantum computing protocols (BQC) enable a classical client with limited quantum technology to delegate a computation to the quantum server(s) in such a way that the privacy of the computation is preserved. Here we present a new scheme for BQC that uses the concept of the measurement based quantum computing with the novel resource state of Affleck-Kennedy-Lieb-Tasaki (AKLT) chains leading to more robust computation. AKLT states are physically motivated resource as they are gapped ground states of a physically natural Hamiltonian in condensed matter physics. Our BQC protocol can enjoy the advantages of AKLT resource states (in a multiserver setup), such as the cooling preparation of the resource state, the energy-gap protection of the quantum computation. It also provides a simple and efficient preparation of the resource state in linear optics with biphotons.
11
Efthymiou, Stavros, Sergi Ramos-Calderer, Carlos Bravo-Prieto, Adrián Pérez-Salinas, Diego García-Martín, Artur Garcia-Saez, José Ignacio Latorre y Stefano Carrazza. "Qibo: a framework for quantum simulation with hardware acceleration". Quantum Science and Technology 7, n.º 1 (16 de diciembre de 2021): 015018. http://dx.doi.org/10.1088/2058-9565/ac39f5.
Texto completoResumen
Abstract We present Qibo, a new open-source software for fast evaluation of quantum circuits and adiabatic evolution which takes full advantage of hardware accelerators. The growing interest in quantum computing and the recent developments of quantum hardware devices motivates the development of new advanced computational tools focused on performance and usage simplicity. In this work we introduce a new quantum simulation framework that enables developers to delegate all complicated aspects of hardware or platform implementation to the library so they can focus on the problem and quantum algorithms at hand. This software is designed from scratch with simulation performance, code simplicity and user friendly interface as target goals. It takes advantage of hardware acceleration such as multi-threading Central Processing Unit (CPU), single Graphics Processing Unit (GPU) and multi-GPU devices.
12
Zhang, Jinglei, Ryan Ferguson, Stefan Kühn, Jan F. Haase, C. M. Wilson, Karl Jansen y Christine A. Muschik. "Simulating gauge theories with variational quantum eigensolvers in superconducting microwave cavities". Quantum 7 (23 de octubre de 2023): 1148. http://dx.doi.org/10.22331/q-2023-10-23-1148.
Texto completoResumen
Quantum-enhanced computing methods are promising candidates to solve currently intractable problems. We consider here a variational quantum eigensolver (VQE), that delegates costly state preparations and measurements to quantum hardware, while classical optimization techniques guide the quantum hardware to create a desired target state. In this work, we propose a bosonic VQE using superconducting microwave cavities, overcoming the typical restriction of a small Hilbert space when the VQE is qubit based. The considered platform allows for strong nonlinearities between photon modes, which are highly customisable and can be tuned in situ, i.e. during running experiments. Our proposal hence allows for the realization of a wide range of bosonic ansatz states, and is therefore especially useful when simulating models involving degrees of freedom that cannot be simply mapped to qubits, such as gauge theories, that include components which require infinite-dimensional Hilbert spaces. We thus propose to experimentally apply this bosonic VQE to the U(1) Higgs model including a topological term, which in general introduces a sign problem in the model, making it intractable with conventional Monte Carlo methods.
13
Ma, Yao, Elham Kashefi, Myrto Arapinis, Kaushik Chakraborty y Marc Kaplan. "QEnclave - A practical solution for secure quantum cloud computing". npj Quantum Information 8, n.º 1 (5 de noviembre de 2022). http://dx.doi.org/10.1038/s41534-022-00612-5.
Texto completoResumen
AbstractWe introduce a secure hardware device named a QEnclave that can secure the remote execution of quantum operations while only using classical controls. This device extends to quantum computing from the classical concept of a secure enclave that isolates a computation from its environment to provide privacy and tamper-resistance. Remarkably, our QEnclave only performs single qubit rotations but can nevertheless be used to secure an arbitrary quantum computation even if the qubit source is controlled by an adversary. More precisely, by attaching a QEnclave to a quantum computer, a remote client controlling the QEnclave can securely delegate its computation to the server solely using classical communication. We investigate the security of our QEnclave by modeling it as an ideal functionality named remote state rotation (RSR). We show that this resource, similar to the previously introduced functionality of remote state preparation, allows blind delegated quantum computing with perfect security. Our proof under the Abstract Cryptography framework shows the construction of remote state preparation from remote state rotation while preserving security. An immediate consequence is the weakening of the requirements for blind delegated computation. While previous delegated protocols relied on a client that can either generate or measure quantum states, we show that this same functionality can be achieved with a client that only transforms quantum states without generating or measuring them.
14
Dunjko, Vedran, Theodoros Kapourniotis y Elham Kashefi. "Quantum-enhanced secure delegated classical computing". Quantum Information and Computation, enero de 2016, 61–86. http://dx.doi.org/10.26421/qic16.1-2-5.
Texto completoResumen
We present a family of quantumly-enhanced protocols to achieve unconditionally secure delegated classical computation where the client and the server have both their classical and quantum computing capacity limited. We prove the same task cannot be achieved using only classical protocols. This extends the work of Anders and Browne on the computational power of correlations to a security setting. In doing so we are able to highlight the power of online quantum communication as we prove the same task could not be achieved using pre-shared (offline) quantum correlations.
15
Zeuner, Jonas, Ioannis Pitsios, Si-Hui Tan, Aditya N. Sharma, Joseph F. Fitzsimons, Roberto Osellame y Philip Walther. "Experimental quantum homomorphic encryption". npj Quantum Information 7, n.º 1 (5 de febrero de 2021). http://dx.doi.org/10.1038/s41534-020-00340-8.
Texto completoResumen
AbstractQuantum computers promise not only to outperform classical machines for certain important tasks, but also to preserve privacy of computation. For example, the blind quantum computing protocol enables secure delegated quantum computation, where a client can protect the privacy of their data and algorithms from a quantum server assigned to run the computation. However, this security comes with the practical limitation that the client and server must communicate after each step of computation. A practical alternative is homomorphic encryption, which does not require any interactions, while providing quantum-enhanced data security for a variety of computations. In this scenario, the server specifies the computation to be performed, and the client provides only the input data, thus enabling secure noninteractive computation. Here, we demonstrate homomorphic-encrypted quantum computing with unitary transformations of individual qubits, as well as multi-qubit quantum walk computations using single-photon states and non-birefringent integrated optics. The client encrypts their input in the photons’ polarization state, while the server performs the computation using the path degree of freedom. Our demonstration using integrated quantum photonics underlines the applicability of homomorphic-encrypted quantum computations, and shows the potential for delegated quantum computing using photons.
16
Ma, Shuquan, Changhua Zhu, Min Nie, Dongxiao Quan y Changxing Pei. "Secure delegated quantum computation based on Z-rotation encryption". Europhysics Letters, 28 de enero de 2022. http://dx.doi.org/10.1209/0295-5075/ac4fd2.
Texto completoResumen
Abstract Quantum computing on encrypted data allows a client who has limited quantum capacity to delegate his or her private computation to an untrusted quantum server, meanwhile the input and output are encrypted by the quantum one-time pad and only the client can correctly decrypt them. Generally, the client is required to have ability to prepare some single qubits and perform some basic gates. In this work, we consider a further restricted situation where the client can only prepare one single qubit and perform one basic gate. Specifically, we show that as long as the client can prepare a fixed qubit |+〉 and perform a fixed phase gate P, then he or she can still achieve the secure delegated quantum computation. Besides, our protocol can provide a more rigorous security for any quantum computation. For example, even if some encryption keys about the computation are leaked, it can still guarantee the privacy of the input and output. Finally, our protocol experimentally has a great significance in reducing the device complexity of the client’s side.
17
Kapourniotis, Theodoros, Elham Kashefi, Dominik Leichtle, Luka Music y Harold Ollivier. "Unifying Quantum Verification and Error-Detection: Theory and Tools for Optimisations". Quantum Science and Technology, 2 de mayo de 2024. http://dx.doi.org/10.1088/2058-9565/ad466d.
Texto completoResumen
Abstract With the advent of cloud-based quantum computing, it has become vital to provide strong guarantees that computations delegated by clients to quantum service providers have been executed faithfully. Secure - blind and verifiable - Delegated Quantum Computing (SDQC) has emerged as one of the key approaches to address this challenge, yet current protocols lack at least one of the following three ingredients: composability, noise-robustness and modularity.

To tackle this question, our paper lays out the fundamental structure of SDQC protocols, namely mixing two components: the computation which the client would like the server to perform and tests that are designed to detect a server's malicious behaviour. Using this abstraction, our main technical result is a set of sufficient conditions on these components which imply the security and noise-robustness of generic SDQC protocols in the composable Abstract Cryptography framework. This is done by establishing a correspondence between these security properties and the error-detection capabilities of the test computations. Changing the types of tests and how they are mixed with the client's computation automatically yields new SDQC protocols with different security and noise-robustness capabilities.

This approach thereby provides the desired modularity as our sufficient conditions on test computations simplify the steps required to prove the security of the protocols and allows to focus on the design and optimisation of test rounds to specific situations. We showcase this by systematising the search for improved SDQC protocols for Bounded-error Quantum Polynomial-time (BQP) computations. The resulting protocols do not require more hardware on the server's side than what is necessary to blindly delegate the computation without verification, and they outperform all previously known results.
18
Polacchi, Beatrice, Dominik Leichtle, Leonardo Limongi, Gonzalo Carvacho, Giorgio Milani, Nicolò Spagnolo, Marc Kaplan, Fabio Sciarrino y Elham Kashefi. "Multi-client distributed blind quantum computation with the Qline architecture". Nature Communications 14, n.º 1 (25 de noviembre de 2023). http://dx.doi.org/10.1038/s41467-023-43617-0.
Texto completoResumen
AbstractUniversal blind quantum computing allows users with minimal quantum resources to delegate a quantum computation to a remote quantum server, while keeping intrinsically hidden input, algorithm, and outcome. State-of-art experimental demonstrations of such a protocol have only involved one client. However, an increasing number of multi-party algorithms, e.g. federated machine learning, require the collaboration of multiple clients to carry out a given joint computation. In this work, we propose and experimentally demonstrate a lightweight multi-client blind quantum computation protocol based on a recently proposed linear quantum network configuration (Qline). Our protocol originality resides in three main strengths: scalability, since we eliminate the need for each client to have its own trusted source or measurement device, low-loss, by optimizing the orchestration of classical communication between each client and server through fast classical electronic control, and compatibility with distributed architectures while remaining intact even against correlated attacks of server nodes and malicious clients.
19
"28th International Nuclear Physics Conference (INPC2022)". Journal of Physics: Conference Series 2586, n.º 1 (1 de septiembre de 2023): 011001. http://dx.doi.org/10.1088/1742-6596/2586/1/011001.
Texto completoResumen
The 28th International Nuclear Physics Conference (INPC2022) was successfully held in Cape Town, South Africa from 11 to 16 September 2022, marking the first time the conference was held on the African continent. This event, overseen by the International Union of Pure and Applied Physics (IUPAP), coincided with three major scientific events: The International Year of Basic Sciences for Sustainable Development (IYBSSD), the centenaries of the Nobel Prize awarded to Niels Bohr and the establishment of IUPAP. The conference program spanned a wide range of topics across the breadth of Nuclear Physics, from hadrons to nuclei, from fundamental science to applications, covering topics such as Hadron Structure and Spectroscopy and QCD Partonic Phenomena, Hot and Dense Nuclear Matter, Nuclear Structure and Nuclear Reactions, Nuclear Astrophysics, Applications and Societal Impact, Neutrinos and Nuclei, Fundamental Interactions and Symmetries, New Facilities and Instrumentation, Outreach and Science Education, and Quantum Computing, Machine Learning, and Artificial Intelligence in Nuclear Physics. The in-person conference was the largest to bring our scientific community together since the COVID-19 pandemic, and provided an excellent opportunity for the 468 delegates to explore the latest progress in the field and reconnect with colleagues. The INPC2022 was a great success, providing an excellent platform for the delegates to share their latest research work, techniques, experiences, challenges, and innovative solutions with colleagues from around the world and provided an opportunity for over 40 African students to be exposed to the field. The conference coincided with the completion of many projects that constitute the pillars of the 2017-2022 Long-Range Plan of iThemba LABS. The delegates had the opportunity to visit the facility and appreciate the advancement and completion of many of these pillars. The INPC2022 was sponsored and supported by the South African National Convention Bureau, Department of Science and Innovation, National Research Foundation, Cape Peninsula University of Technology, University of the Witwatersrand, University of the Western Cape, University of Cape Town, Metrological and Applied Sciences University Research Unit, IUPAP, NuPECC, ACF Metals, XIA and IBA. List of Local Organizing Committee, International Advisory Committee, Session Conveners are available in this pdf.
20
"Preface". Journal of Physics: Conference Series 2405, n.º 1 (1 de diciembre de 2022): 011001. http://dx.doi.org/10.1088/1742-6596/2405/1/011001.
Texto completoResumen
The 2022 International Conference on Electronics Technology and Artificial Intelligence (ETAI 2022) was successfully held on September 23rd-25th, 2022 in Chongqing, China (online conference). ETAI 2022 promoted scientific innovation, expanded channels of international academic exchange in science and technology, boosted the development of the Greater Bay Area, and strengthened academic cooperation between China and the outside world. In the conference, we were greatly honored to have Prof. Zhikui Chen from Dalian University of Technology, China to serve as our Conference General Chair. The conference was composed of keynote speeches, oral presentations and online Q&A discussion, attracting 100 delegates worldwide. Firstly, the keynote speakers were each allocated 30-45 minutes to address their speeches. Then in the next part, oral presentations, the excellent papers we had selected were presented by their authors one by one. Four distinguished professors were invited to hold keynote speeches during the conference. Primarily, Prof. Ning Sun from Nankai University, China performed a keynote speech on Modeling, Dynamics, and Intelligent Control of Complicated Underactuated Cranes: Theory and Experiments. And then, Prof. Huajun Dong from Dalian Jiaotong University, China made a report on the title Researches on Characteristics of Vacuum Switching Arc and Actuator. Moreover, Assoc. Prof. Guanglei Wu from Dalian University of Technology, China reported on Path Planning of Industrial Robots for Obstacle Avoidance. Last but not the least, Prof. Bhanu Prakash Kolla from K L University, India shared with us his research: Quantum Computing. All of them combined their own research areas with the conference theme to make dramatic keynote speeches, which triggered heated discussion in the conference. Every participant praised this conference for disseminating insightful knowledge. We are glad to share with you that we’ve selected a bunch of high-quality papers from the submissions and compiled them into the proceedings after rigorously reviewing them. These papers feature but are not limited to the following topics: Electronic Signals, Advanced Electromagnetics, Intelligent Automation, Fuzzy Logic, etc. All the papers have been checked through rigorous review and processes to meet the requirements of publication. We would like to acknowledge all of those who supported ETAI 2022 and made it a great success. In particular, we would like to thank the Journal of Physics: Conference Series, for the hard work of all its colleagues in publishing this paper volume. We sincerely hope that ETAI 2022 turned out to be a forum for excellent discussions that enable new ideas to come about, promoting collaborative research. The Committee of ETAI 2022 List of Committee member is available in this Pdf.