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

42nd ACM SIGPLAN International Conference on programming Language Design and Implementation (PLDI)

作者： Tao, Runzhou Shi, Yunong Yao, Jianan Hui, John Chong, Frederic T. Gu, Ronghui Columbia Univ New York NY 10027 USA Univ Chicago Chicago IL 60637 USA Amazon New York NY USA Supertech Chicago IL USA Quantum Circuits Inc Chicago IL USA

ISBN: (纸本)9781450383912

Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the ((rho) over cap,delta)-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state (rho) over cap and its distance d to the ideal state rho?. This predicate ((rho) over cap,delta) can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the ((rho) over cap,delta)-diamond norm metric. Our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.

关键词： quantum programming error analysis approximate computing

来源：评论

学校读者我要写书评

暂无评论

A Guide for quantum Web Services Deployment 22nd

A Guide for Quantum Web Services Deployment

引用

22nd International Conference on Web Engineering (ICWE)

作者： Alvarado-Valiente, Jaime Romero-Alvarez, Javier Garcia-Alonso, Jose Murillo, Juan M. Univ Extremadura Quercus Software Engn Grp Escuela Politecn Av Univ S-N Caceres 10003 Spain

ISBN: (纸本)9783031099175;9783031099168

quantum computing is a new paradigm for solving problems that classical computers cannot reach. To the point that it is already generating interest in the scientific and industrial communities. Currently, quantum computers and technology are being developed to support the execution of quantum software. Several large computer companies have already built functional quantum computers, and developed several programming languages and quantum simulators that can be used by the general public. All this infrastructure for quantum computing is offered to quantum developers through the cloud, following a model similar to the familiar Infrastructure as a Service. However, due to the early stages of quantum computing taking advantage of the capabilities of these computers requires a very in depth knowledge of quantum programming and quantum hardware that is far from what cloud developers are used to in classical cloud offerings. Although the future of quantum computing is still unknown, it is highly certain that there must be a time when quantum computing coexists with classical computing. At the same time, one of the most well-known and tested solutions for the communication of heterogeneous computing systems are web services. In this tutorial we will offer an introductory view on how quantum algorithms can be converted into web services, how this web services can be deployed, using the Amazon Braket platform for quantum computing, and invoked through classical web services endpoints. Finally, we will propose a way in which a disadvantage of current quantum computers in terms of web services can be transformed into an advantage for web services through the use of a quantum API Gateway.

关键词： quantum software development quantum web services quantum programming

来源：评论

学校读者我要写书评

暂无评论

quantum Computing: State-of-art and Challenges

Quantum Computing: State-of-art and Challenges

引用

Workshop-School on Theoretical Computer Science (WEIT)

作者： Vizzotto, Juliana Kaizer CT UFSM Dept Linguagens & Sistemas Computacao Programa Posgrad Informat Santa Maria RS Brazil

In this article we review the concept of quantum computing and briefly discuss the state-of-art and some actual challenges in the field of software (i.e. programming languages and algorithms) for quantum computing.

ISBN: (纸本)9781479930579

关键词： quantum computing quantum programming quantum algorithms

来源：评论

学校读者我要写书评

暂无评论

quantum types: going beyond qubits and quantum gates 5

Quantum types: going beyond qubits and quantum gates

引用

5th International Workshop on quantum Software Engineering (Q-SE)

作者： Varga, Tamas Aragones-Soria, Yaiza Oriol, Manuel Constructor Inst Schaffhausen Schaffhausen Switzerland Constructor Univ Bremen Bremen Germany

ISBN: (纸本)9798400705700

quantum computing is a growing field with significant potential applications. Learning how to code quantum programs means understanding how qubits work and learning to use quantum gates. This is analogous to creating classical algorithms using logic gates and bits. Even after learning all concepts, it is difficult to create new algorithms, which hinders the acceptance of quantum programming by most developers. This article outlines the need for higher-level abstractions and proposes some of them in a developer-friendly programming language called Rhyme. The new quantum types are extensions of classical types, including bits, integers, floats, characters, arrays, and strings. We show how to use such types with code snippets.

关键词： quantum computing quantum programming quantum data types High-level abstractions

来源：评论

学校读者我要写书评

暂无评论

Sized Types for Low-Level quantum Metaprogramming 11th

Sized Types for Low-Level Quantum Metaprogramming

引用

11th International Conference on Reversible Computation (RC)

作者： Amy, Matthew Univ Waterloo Waterloo ON Canada

ISBN: (纸本)9783030215002;9783030214999

One of the most fundamental aspects of quantum circuit design is the concept of families of circuits parametrized by an instance size. As in classical programming, metaprogramming allows the programmer to write entire families of circuits simultaneously, an ability which is of particular importance in the context of quantum computing as algorithms frequently use arithmetic over non-standard word lengths. In this work, we introduce metaQASM, a typed extension of the openQASM language supporting the metaprogramming of circuit families. Our language and type system, built around a lightweight implementation of sized types, supports subtyping over register sizes and is moreover type-safe. In particular, we prove that our system is strongly normalizing, and as such any well-typed metaQASM program can be statically unrolled into a finite circuit.

关键词： quantum programming Circuit description languages Metaprogramming

来源：评论

学校读者我要写书评

暂无评论

Teaching quantum Computing through a Practical Software-driven Approach Experience Report 20

Teaching Quantum Computing through a Practical Software-driv...

引用

51st ACM SIGCSE Technical Symposium on Computer Science Education (SIGCSE)

作者： Mykhailova, Mania Svore, Krysta M. Microsoft Microsoft Quantum Redmond WA 98052 USA

ISBN: (纸本)9781450367936

quantum computing harnesses quantum laws of nature to enable new types of algorithms, not efficiently possible on traditional computers, that may lead to breakthroughs in crucial areas like materials science and chemistry. There is rapidly growing demand for a quantum workforce educated in the basics of quantum computing, in particular in quantum programming. However, there are few offerings for non-specialists and little information on best practices for training computer science and engineering students. In this report we describe our experience teaching an undergraduate course on quantum computing using a practical, software-driven approach. We centered our course around teaching quantum algorithms through hands-on programming, reducing the significance of traditional written assignments and relying instead on self-paced programming exercises ("quantum Katas"), a variety of programming assignments, and a final project. We observed that the programming sections of the course helped students internalize theoretical material presented during the lectures. In the survey results, students indicated that the programming exercises and the final project contributed the most to their learning process. We describe the motivation for centering the course around quantum programming, discuss major artifacts used in this course, and present our lessons learned and best practices for a future improved course offering. We hope that our experience will help guide instructors who want to adopt a practical approach to teaching quantum computing and will enable more undergraduate programs to offer quantum programming as an elective.

关键词： quantum computing quantum programming curriculum case study

来源：评论

学校读者我要写书评

暂无评论

Full abstraction for the quantum lambda-Calculus

Full abstraction for the quantum lambda-Calculus

引用

Proceedings of the ACM on programming Languages

作者： Clairambault, Pierre De Visme, Marc Univ Lyon EnsL UCBL CNRS LIP LYON LYON Cedex 07F-69364 France

quantum programming languages permit a hardware independent, high-level description of quantum algorithms. In particular, the quantum γ-calculus is a higher-order language with quantum primitives, mixing quantum data and classical control. Giving satisfactory denotational semantics to the quantum γ-calculus is a challenging problem that has attracted significant interest. In the past few years, both static (the quantum relational model) and dynamic (quantum game semantics) denotational models were given, with matching computational adequacy results. However, no model was known to be fully abstract. Our first contribution is a full abstraction result for the games model of the quantum γ-calculus. Full abstraction holds with respect to an observational quotient of strategies, obtained by summing valuations of all states matching a given observable. Our proof method for full abstraction extends a technique recently introduced to prove full abstraction for probabilistic coherence spaces with respect to probabilistic PCF. Our second contribution is an interpretation-preserving functor from quantum games to the quantum relational model, extending a long line of work on connecting static and dynamic denotational models. From this, it follows that the quantum relational model is fully abstract as well. Altogether, this gives a complete denotational landscape for the semantics of the quantum γ-calculus, with static and dynamic models related by a clean functorial correspondence, and both fully abstract. © 2020 Copyright held by the owner/author(s).

关键词： Calculations Abstracting Algebra Differentiation (calculus) High level languages quantum theory Semantics Computational adequacy Full abstraction Game semantics High level description Higher order languages quantum programming quantum programming languages Static and dynamic models

来源：评论

学校读者我要写书评

暂无评论

Relational proofs for quantum programs

Relational proofs for quantum programs

引用

Proceedings of the ACM on programming Languages

作者： Barthe, Gilles Hsu, Justin Ying, Mingsheng Yu, Nengkun Zhou, Li Max Planck Institute for Security and Privacy Germany IMDEA Software Institute Spain Department of Computer Sciences University of Wisconsins Madison United States Centre for Quantum Software and Information University of Technology Sydney Australia State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Tsinghua University China Department of Computer Science and Technology Tsinghua University China

Relational verification of quantum programs has many potential applications in quantum and post-quantum security and other domains. We propose a relational program logic for quantum programs. The interpretation of our logic is based on a quantum analogue of probabilistic couplings. We use our logic to verify non-trivial relational properties of quantum programs, including uniformity for samples generated by the quantum Bernoulli factory, reliability of quantum teleportation against noise (bit and phase flip), security of quantum one-time pad and equivalence of quantum walks. © 2020 Copyright held by the owner/author(s).

关键词： Application programs Computer circuits Couplings Verification Non trivial One time pads Post quantum securities Program logic quantum programming quantum teleportation quantum walk Relational properties

来源：评论

学校读者我要写书评

暂无评论

Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs

引用

INFORMATION AND COMPUTATION 2023年第1期294卷

作者： Feng, Yuan Li, Sanjiang Univ Technol Sydney Ctr Quantum Software & Informat Ultimo Australia

interpretation, Hoare logic, and incorrectness (or reverse Hoare) logic are powerful techniques for static analysis of computer programs. They have all been successfully extended to the quantum setting, but developed largely in parallel. This paper explores the relationship between these techniques in the context of verifying quantum whileprograms, where the abstract domain and the set of assertions for quantum states are wellstructured. We show that any complete quantum abstract interpretation induces a quantum Hoare logic and a quantum incorrectness logic, both being sound and relatively complete. Moreover, the induced logic systems operate in a forward manner, making them more suitable for certain applications. Conversely, any sound and relatively complete quantum Hoare logic or incorrectness logic induces a complete quantum abstract interpretation. As an application, we show the non-existence of any sound and relatively complete quantum Hoare logic or incorrectness logic if tuples of local subspaces are taken as assertions. & COPY;2023 Elsevier Inc. All rights reserved.

关键词： quantum programming Abstract interpretation Incorrectness logic

来源：评论

学校读者我要写书评

暂无评论

Structured Theorem for quantum Programs and its Applications

引用

ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY 2023年第4期32卷 103-103页

作者： Yu, Nengkun SUNY Stony Brook Dept Comp Sci 100 Nicolls Rd Stony Brook NY 11794 USA Univ Technol Sydney Ctr Quantum Software & Informat Sydney NSW Australia

This article proves a structured program theorem for flowchart quantum programs. The theorem states that any flowchart quantum program is equivalent to a single quantum program that repeatedly executes a quantum measurement and a subprogram, so long as the measurement outcome is true. Moreover, their expected runtime, variance, and general moments are the same. This theorem simplifies the quantum program's verification significantly. - We derive an analytical characterization of the termination problem for quantum programs in polynomial time. Our procedure is more efficient and accurate with much simpler techniques than the analysis of this problem, as described in [29]. - We compute the expected runtime analytically and exactly for quantum programs in polynomial time. This result improves the methods based on the weakest precondition calculus for the question recently developed in [31, 34]. - We show that a single loop rule is a relatively complete Hoare logic for quantum programs after applying our structured theorem. Although using fewer rules, our method verifies a broader class of quantum programs, compared with the results in [45] and [56].

关键词： quantum programming flowchart language while-language structure programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：