Bug-catching is important for developing quantum programs. Motivated by the incorrectness logic for classical programs, we propose an incorrectness logic towards a logical foundation for static bug-catching in quantum programming. The validity of formulas in this logic is dual to that of quantum Hoare logics. We justify the formulation of validity by an intuitive explanation from a reachability point of view and a comparison against several alternative formulations. Compared with existing works focusing on dynamic analysis, our logic provides sound and complete arguments. We further demonstrate the usefulness of the logic by reasoning several examples, including Grover's search, quantum teleportation, and a repeat-until-success program. We also automate the reasoning procedure by a prototyped static analyzer built on top of the logic rules.
The skin excretes substances primarily through sweat glands. Several conditions have been demonstrated to be associated with diminished sweating. However, few studies have concentrated on the metabolism and excretion of sweat. This review focuses on the relationship between temperature and the thermoregulatory efficacy of sweat, and then discusses the excretion of sweat, which includes the metabolism of water, minerals, proteins, vitamins as well as toxic substances. The potential role of sweat secretion in hormone homeostasis and the effects on the defense system of the skin are also clarified.
Quantum computation is inevitably subject to imperfections in its implementation. These imperfections arise from various sources, including environmental noise at the hardware level and the introduction of approximate implementations by quantum algorithm designers, such as lower-depth computations. Given the significant advantage of relational logic in program reasoning and the importance of assessing the robustness of quantum programs between their ideal specifications and imperfect implementations, we design a proof system to verify the approximate relational properties of quantum programs. We demonstrate the effectiveness of our approach by providing the first formal verification of the renowned low-depth approximation of the quantum Fourier transform. Furthermore, we validate the approximate correctness of the repeat-until-success algorithm. From the technical point of view, we develop approximate quantum coupling as a fundamental tool to study approximate relational reasoning for quantum programs, a novel generalization of the widely used approximate probabilistic coupling in probabilistic programs, answering a previously posed open question for projective predicates.
Quantum key distribution, initialized in 1984, is a commercialized secure communication method that enables two parties to produce a shared random secret key using quantum mechanics. We propose a QQUIC (Quantum-assisted Quick UDP Internet Connections) transport protocol, which modifies the well-known QUIC transport protocol by employing quantum key distribution instead of the original classical algorithms in the key exchange stage. Due to the provable security of quantum key distribution, the security of the QQUIC key does not depend on computational assumptions. It is possible that, surprisingly, QQUIC can reduce network latency in some circumstances even compared with QUIC. To achieve this, the attached quantum connections are used as the dedicated lines for key generation.
Designing quantum processors is a complex task that demands advanced verification methods to ensure their correct functionality. However, traditional methods of comprehensively verifying quantum devices, such as quantum process tomography, face significant limitations because of the exponential growth in computational resources. These limitations arise from treating the system as a black box and ignoring its design structure. Consequently, new testing methods must be developed considering the design structure. In this paper, we investigate the structure of computations on the hardware, focusing on the layered interruptible quantum circuit model and designing a scalable algorithm to verify it comprehensively. Specifically, for a given quantum hardware that claims to process an unknown $n$ qubit $d$ layer circuit via a finite set of quantum gates, our method completely reconstructs the circuits within a time complexity of $O\left(d^{2} t \log (n / \delta)\right)$, guaranteeing success with a probability of at least $1-\delta$. Here, $t$ represents the maximum execution time for each circuit layer. Our approach significantly reduces execution time for completely verifying computations in quantum devices, achieving double logarithmic scaling in the problem size. Furthermore, we validate our algorithm through experiments using IBM's quantum cloud service, demonstrating its potential applicability in the noisy intermediate-scale quantum era.