English
Related papers

Related papers: Quantum Hoare Type Theory

200 papers

The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be…

Quantum Physics · Physics 2020-01-27 Alastair A. Abbott

This is an exposition of some of the aspects of quantum computation and quantum information that have connections with operator theory. After a brief introduction, we discuss quantum algorithms. We outline basic properties of quantum…

Operator Algebras · Mathematics 2007-05-23 David W. Kribs

A quantum computer (QC) can solve many computational problems more efficiently than a classic one. The field of QCs is growing: companies (such as DWave, IBM, Google, and Microsoft) are building QC offerings. We position that software…

Software Engineering · Computer Science 2019-07-09 Andriy Miranskyy , Lei Zhang

Quantum computing (QC) is no longer only a scientific interest but is rapidly becoming an industrially available technology that can potentially tackle the limitations of classical computing. Over the last few years, major technology giants…

Software Engineering · Computer Science 2022-11-28 Muhammad Azeem Akbar , Arif Ali Khan , Sajjad Mahmood , Saima Rafi

Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes…

Quantum Physics · Physics 2019-05-28 Alessandro Bisio , Paolo Perinotti

Formal verification provides strong guarantees of correctness of software, which are especially important in safety or security critical systems. Hoare logic is a widely used formalism for rigorous verification of software against…

Programming Languages · Computer Science 2021-03-11 Jayaraj Poroor

Quantum computers have leaped from the theoretical realm into a race to large-scale implementations. This is due to the promise of revolutionary speedups, where achieving such speedup requires designing an algorithm that harnesses the…

An effective, accessible abstraction hierarchy has made using and programming computers possible for people across all disciplines. Establishing such a hierarchy for quantum programming is an outstanding challenge, especially due to a…

Interacting with a standard computer can enhance the capabilities of current quantum computers already today, particularly by offloading certain computations to the standard computer. Quantum computers that interact with standard computers…

Quantum Physics · Physics 2025-09-11 Niels M. P. Neumann

Based on an idea that spatial separation of charge states can enhance quantum coherence, we propose a scheme for quantum computation with quantum bit (qubit) constructed from two coupled quantum dots. Quantum information is stored in…

Quantum Physics · Physics 2009-11-07 Xin-Qi Li , YiJing Yan

Homomorphic encryption is an encryption scheme that allows computations to be evaluated on encrypted inputs without knowledge of their raw messages. Recently Ouyang et al. constructed a quantum homomorphic encryption (QHE) scheme for…

Quantum Physics · Physics 2019-04-29 Ching-Yi Lai , Kai-Min Chung

Quantum computing has demonstrated the potential to solve computationally intensive problems more efficiently than classical methods. Many software engineering tasks, such as test case selection, static analysis, code clone detection, and…

Software Engineering · Computer Science 2025-06-10 Jianjun Zhao

In systems considered for quantum computing, i.e., for control of quantum dynamics with the goal of processing information coherently, decoherence and deviation from pure quantum states, are the main obstacles to fault-tolerant error…

Mesoscale and Nanoscale Physics · Physics 2010-10-12 Vladimir Privman

Quantum Imaginary-Time Evolution (QITE) is a powerful method for preparing ground states on quantum hardware. However, executing QITE has costly measurement budgets for general Hamiltonians. Both fidelity and computational cost are strongly…

Quantum Physics · Physics 2025-12-12 Julio Del Castillo , Mats Granath , Evert van Nieuwenburg

The Quantum Fourier Transform (QFT) is a fundamental component of many quantum computing algorithms. In this paper, we present an alternative method for factoring this transformation. Inspired by this approach, we introduce a new quantum…

Quantum Physics · Physics 2025-07-30 Juan M. Romero , Emiliano Montoya-González , Guillermo Cruz , Roberto C. Romero

Quantum physics is a linear theory, so it is somewhat puzzling that it can underlie very complex systems such as digital computers and life. This paper investigates how this is possible. Physically, such complex systems are necessarily…

Quantum Physics · Physics 2024-03-12 George F R Ellis

In quantum information processing (QIP), the quantum Fourier transform (QFT) has a plethora of applications [1] [2] [3]: Shor's algorithm and phase estimation are just a few well-known examples. Shor's quantum factorization algorithm, one…

Quantum Physics · Physics 2022-05-03 Shlomo Kashani , Maryam Alqasemi , Jacob Hammond

Quantum computing is a growing field where the information is processed by two-levels quantum states known as qubits. Current physical realizations of qubits require a careful calibration, composed by different experiments, due to noise and…

Quantum Physics · Physics 2023-09-15 Edoardo Pedicillo , Andrea Pasquale , Stefano Carrazza

This paper presents an elementary introduction to Consistent Quantum Theory (CQT), as developed by Griffiths and others over the past 25 years. The theory is a version of orthodox(Copenhagen) quantum mechanics, based on the notion that the…

Quantum Physics · Physics 2010-12-06 Pierre C. Hohenberg

We present a lightweight approach to Hoare-style specifications for fine-grained concurrency, based on a notion of time-stamped histories that abstractly capture atomic changes in the program state. Our key observation is that histories…

Logic in Computer Science · Computer Science 2014-10-02 Ilya Sergey , Aleksandar Nanevski , Anindya Banerjee
‹ Prev 1 4 5 6 7 8 10 Next ›