检索结果-内蒙古大学图书馆

Verification of Distributed quantum Programs

ACM TRANSACTIONS ON COMPUTATIONAL LOGIC 2022年第3期23卷 19-19页

作者： Feng, Yuan Li, Sanjiang Ying, Mingsheng Univ Technol Sydney Ctr Quantum Software & Informat 15 Broadway Ultimo NSW 2007 Australia Chinese Acad Sci Inst Software 4 Zhongguancun South Fourth St Beijing 100190 Peoples R China Tsinghua Univ Dept Comp Sci 30 Shuangqing Rd Beijing 100190 Peoples R China

Distributed quantum systems and especially the quantum Internet have the ever-increasing potential to fully demonstrate the power of quantum computation. This is particularly true given that developing a general-purpose quantum computer is much more difficult than connecting many small quantum devices. One major challenge of implementing distributed quantum systems is programming them and verifying their correctness. In this paper, we propose a CSP-like distributed programming language to facilitate the specification and verification of such systems. After presenting its operational and denotational semantics, we develop a Hoare-style logic for distributed quantum programs and establish its soundness and (relative) completeness with respect to both partial and total correctness. The effectiveness of the logic is demonstrated by its applications in the verification of quantum teleportation and local implementation of non-local CNOT gates, two important algorithms widely used in distributed quantum systems.

关键词： quantum programming distributed computing formal verification Hoare logic

来源：评论

学校读者我要写书评

暂无评论

Exploring quantum Comprehension Through the Elitzur-Vaidman Bomb Testing Problem

引用

BRAZILIAN JOURNAL OF PHYSICS 2023年第6期53卷 152-152页

作者： Pinto, Vinicius Pereira de Oliveira, Bruno Pereira Yasuoka, Fatima Maria Mitsue Courteille, Philippe Wilhelm de Castro Neto, Jarbas Caiado Univ Sao Paulo Sao Carlos Inst Phys BR-13560970 Sao Carlos SP Brazil BR Labs Tecnol Opt & Foton Ltda BR-13567020 Sao Carlos SP Brazil

The Elitzur-Vaidman bomb testing problem is a thought experiment in quantum mechanics that explores the concepts of quantum superposition and entanglement. The problem creates a scenario where a bomb is activated by absorbing a single photon and suggests testing that it works without exploding it, so that classically, it is impossible to know if the bomb works without disturbing the system. Therefore, an interferometer with two arms and two outputs is proposed, mounted in such a way that only one of them has positive interference. However, when placing a pump that works in one of the arms, the interference pattern breaks down, and it can be inferred that the pump works without interacting with it. In this work, a methodology is adopted that combines computational simulations and a simple experimental proposal to investigate the concept of interaction-free measurements. The IBM quantum cloud programming language (Qiskit Runtime) is utilized to simulate the experiments, and an experimental approach is proposed that uses simple laser sources to qualitatively test the theory, offering a practical perspective for developing an understanding of quantum concepts.

关键词： quantum superposition Interference quantum programming Interaction-free measurement quantum Zeno effect

来源：评论

学校读者我要写书评

暂无评论

QISS: quantum-Enhanced Sustainable Security Incident Handling in the IoT

引用

INFORMATION 2024年第4期15卷 181-181页

作者： Blanco, Carlos Santos-Olmo, Antonio Sanchez, Luis Enrique Univ Cantabria Dept Comp Sci & Elect Santander 39005 Spain Univ Castilla La Mancha Techonol & Informat Syst Dept Ciudad Real 13071 Spain

As the Internet of Things (IoT) becomes more integral across diverse sectors, including healthcare, energy provision and industrial automation, the exposure to cyber vulnerabilities and potential attacks increases accordingly. Facing these challenges, the essential function of an Information Security Management System (ISMS) in safeguarding vital information assets comes to the fore. Within this framework, risk management is key, tasked with the responsibility of adequately restoring the system in the event of a cybersecurity incident and evaluating potential response options. To achieve this, the ISMS must evaluate what is the best response. The time to implement a course of action must be considered, as the period required to restore the ISMS is a crucial factor. However, in an environmentally conscious world, the sustainability dimension should also be considered to choose more sustainable responses. This paper marks a notable advancement in the fields of risk management and incident response, integrating security measures with the wider goals of sustainability and corporate responsibility. It introduces a strategy for handling cybersecurity incidents that considers both the response time and sustainability. This approach provides the flexibility to prioritize either the response time, sustainability or a balanced mix of both, according to specific preferences, and subsequently identifies the most suitable actions to re-secure the system. Employing a quantum methodology, it guarantees reliable and consistent response times, independent of the incident volume. The practical application of this novel method through our framework, MARISMA, is demonstrated in real-world scenarios, underscoring its efficacy and significance in the contemporary landscape of risk management.

关键词： cybersecurity sustainability incident response quantum programming quantum annealing

来源：评论

学校读者我要写书评

暂无评论

A formally certified end-to-end implementation of Shor's factorization algorithm

引用

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA 2023年第21期120卷 e2218775120-e2218775120页

作者： Peng, Yuxiang Hietala, Kesha Tao, Runzhou Li, Liyi Rand, Robert Hicks, Michael Wu, Xiaodi Univ Maryland Dept Comp Sci College Pk MD 20740 USA Univ Maryland Joint Ctr Quantum Informat & Comp Sci College Pk MD 20740 USA Columbia Univ Dept Comp Sci New York NY 10027 USA Univ Chicago Dept Comp Sci Chicago IL 60637 USA

quantum computing technology may soon deliver revolutionary improvements in algorithmic performance, but it is useful only if computed answers are correct. While hardware-level decoherence errors have garnered significant attention, a less recognized obstacle to correctness is that of human programming errors-"bugs." Techniques familiar to most programmers from the classical domain for avoiding, discovering, and diagnosing bugs do not easily transfer, at scale, to the quantum domain because of its unique characteristics. To address this problem, we have been working to adapt formal methods to quantum programming. With such methods, a programmer writes a mathematical specification alongside the program and semiautomatically proves the program correct with respect to it. The proof's validity is automatically confirmed- certified-by a "proof assistant." Formal methods have successfully yielded high assurance classical software artifacts, and the underlying technology has produced certified proofs of major mathematical theorems. As a demonstration of the feasibility of applying formal methods to quantum programming, we present a formally certified end-to-end implementation of Shor's prime factorization algorithm, developed as part of a framework for applying the certified approach to general applications. By leveraging our framework, one can significantly reduce the effects of human errors and obtain a high-assurance implementation of large-scale quantum applications in a principled way.

关键词： quantum programming formal methods Shor's algorithm human errors

来源：评论

学校读者我要写书评

暂无评论

quantum Weakest Preconditions for Reasoning about Expected Runtimes of quantum Programs 22

Quantum Weakest Preconditions for Reasoning about Expected R...

引用

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science

作者： Junyi Liu Li Zhou Gilles Barthe Mingsheng Ying Institute of Software Chinese Academy of Sciences China and University of Chinese Academy of Sciences China Max Planck Institute for Security and Privacy Germany Max Planck Institute for Security and Privacy Germany and IMDEA Software Institute Spain Institute of Software Chinese Academy of Sciences China and Tsinghua University China

ISBN: (纸本)9781450393515

We study expected runtimes for quantum programs. Inspired by recent work on probabilistic programs, we first define expected runtime as a generalisation of quantum weakest precondition. Then, we show that the expected runtime of a quantum program can be represented as the expectation of an observable (in physics). A method for computing the expected runtimes of quantum programs in finite-dimensional state spaces is developed. Several examples are provided as applications of this method, including computing the expected runtime of quantum Bernoulli Factory – a quantum algorithm for generating random numbers. In particular, using our new method, an open problem of computing the expected runtime of quantum random walks introduced by Ambainis et al. (STOC 2001) is solved.

关键词： quantum programming termination quantum random walk quantum weakest precondition physical observable expected runtime

来源：评论

学校读者我要写书评

暂无评论

Introduction to quantum Computing 20

Introduction to Quantum Computing

引用

Proceedings of the 51st ACM Technical Symposium on Computer Science Education

作者： Chris Granade Mariia Mykhailova Mark Tsang Microsoft Corporation Redmond WA USA

ISBN: (纸本)9781450367936

In just hours or days, a quantum computer can solve complex problems that would otherwise take billions of years for today's computers to solve. This has massive implications for research and workforce development for healthcare, energy, and environmental systems. Microsoft is focused on bringing the only scalable quantum system to the broadest set of customers and partnering with universities to ensure that we have the people ready to staff the quantum economy and ecosystem of *** workshop includes: An overview of quantum computing. A brief landscape discussion on Microsoft's unique approach to quantum computing, including our "full stack" approach and why there is high demand for learning quantum computing these days. An overview and case study of hands-on, software-driven quantum computing curriculum. Our quantum computing experts partnered with University of Washington to bring a 10-week, for credit, course "Introduction to quantum computing and quantum programming in Q#" to the school of Computer Science. We discuss why it is important to bring quantum programming into quantum computing courses, showcase our approach to doing this and discuss the results. Demo and Hands-on: In this session you will learn one of the core quantum algorithms, Grover's search, in a hands-on quantum programming tutorial. You will implement the algorithm in Q# and see how it enables a quadratic speedup for solving search problems. You will also learn how students can get started with hands-on quantum programming quickly by completing a rich collection of self-guided quantum programming tutorials exercises in Q# (the quantum Katas). Please bring laptop computers for hands-on portion.

关键词： quantum computing grover's search algorithm case study software-driven curriculum quantum programming

来源：评论

学校读者我要写书评

暂无评论

Development of quantum Safe Polynomial-Based Cryptography in Classical and quantum Framework

引用

INTERNET TECHNOLOGY LETTERS 2024年第0期

作者： Hasija, Taniya Ramkumar, K. R. Singh, Bhupendra Chitkara Univ Inst Engn & Technol Rajpura Punjab India Def Res & Dev Org Ctr Artificial Intelligence & Robot Bangalore India

The advent of quantum computers has brought forth a substantial danger to the security of current cryptographic algorithms, necessitating the development of quantum-resistant algorithms to ensure data protection. The encryption method proposed in this article uses polynomials and is intended to counter key size-based attacks. This paper brings a novel method of using polynomial interpolations for encryption and decryption, and the proposed algorithm is implemented in both classical and quantum environments to check its feasibility and accuracy. To ensure protection from the outside world, the proposed technique is applied in key generation, encryption, decryption, and confusion-diffusion modules. This article also tabulated the National Institute of Standard and Technology (NIST) test suit results for randomness acceptability criteria and compares the new algorithm with the Kyber algorithm. While quantum computers are believed to excel in tasks like factorization and optimization, this paper is the first to explore cryptography algorithms in a quantum environment, opening new research possibilities for future cryptographic developments.

关键词： enterprises Microsoft Q# polynomial-based cryptography QDK quantum programming security

来源：评论

学校读者我要写书评

暂无评论

quantum Expectation Transformers for Cost Analysis 22

Quantum Expectation Transformers for Cost Analysis

引用

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science

作者： Martin Avanzini Georg Moser Romain Pechoux Simon Perdrix Vladimir Zamdzhiev Inria Sophia Antipolis France University of Innsbruck Austria Inria LORIA and Universite de Lorraine France

ISBN: (纸本)9781450393515

We introduce a new kind of expectation transformer for a mixed classical-quantum programming language. Our semantic approach relies on a new notion of a cost structure, which we introduce and which can be seen as a specialisation of the Kegelspitzen of Keimel and Plotkin. We show that our weakest precondition analysis is both sound and adequate with respect to the operational semantics of the language. Using the induced expectation transformer, we provide formal analysis methods for the expected cost analysis and expected value analysis of classical-quantum programs. We illustrate the usefulness of our techniques by computing the expected cost of several well-known quantum algorithms and protocols, such as coin tossing, repeat until success, entangled state preparation, and quantum walks.

关键词： formal semantics complexity analysis quantum programming expectation transformer

来源：评论

学校读者我要写书评

暂无评论

quantum Hoare Logic with Classical Variables

引用

ACM TRANSACTIONS ON quantum COMPUTING 2021年第4期2卷 1-1页

作者： Feng, Yuan Ying, Mingsheng Univ Technol Sydney Sydney Australia Chinese Acad Sci Beijing Peoples R China Tsinghua Univ Beijing Peoples R China Univ Technol Sydney Ctr Quantum Software & Informat Sydney NSW Australia Chinese Acad Sci Inst Software Beijing Peoples R China

Hoare logic provides a syntax-oriented method to reason about program correctness and has been proven effective in the verification of classical and probabilistic programs. Existing proposals for quantumHoare logic either lack completeness or support only quantum variables, thus limiting their capability in practical use. In this article, we propose a quantum Hoare logic for a simple while language that involves both classical and quantum variables. Its soundness and relative completeness are proven for both partial and total correctness of quantum programs written in the language. Remarkably, with novel definitions of classical-quantum states and corresponding assertions, the logic system is quite simple and similar to the traditional Hoare logic for classical programs. Furthermore, to simplify reasoning in real applications, auxiliary proof rules are provided that support standard logical operation in the classical part of assertions and super-operator application in the quantum part. Finally, a series of practical quantum algorithms, in particular the whole algorithm of Shor's factorisation, are formally verified to show the effectiveness of the logic.

关键词： quantum programming quantum while language

来源：评论

学校读者我要写书评

暂无评论

quantum Weakest Preconditions for Reasoning about Expected Runtimes of quantum Programs

引用

Journal of the ACM 1000年

作者： Junyi Liu Li Zhou Gilles Barthe Mingsheng Ying Institute of Software Chinese Academy of Sciences Beijing China Institute of Software Chinese Academy of Sciences Beijing China IMDEA Software Institute Boadilla del Monte Spain Department of Computer Science Tsinghua University Beijing China

We study expected runtimes for quantum programs. Inspired by recent work on probabilistic programs, we first define expected runtime as a generalisation of quantum weakest precondition. Then, we show that the expected runtime of a quantum program should be represented as the expectation of an observable (in physics). A method for computing the expected runtimes of quantum programs in finite-dimensional state spaces is developed. Several examples are provided as applications of this method, including computing the expected runtime of quantum Bernoulli Factory – a quantum algorithm for generating random numbers. In particular, using our new method, an open problem of computing the expected runtime of quantum random walks introduced by Ambainis et al. (STOC 2001) is solved.

关键词： quantum programming quantum weakest precondition expected runtime physical observable termination quantum random walk

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：