117 research outputs found

    Testing Multi-Subroutine Quantum Programs: From Unit Testing to Integration Testing

    Full text link
    Quantum computing has emerged as a promising field with the potential to revolutionize various domains by harnessing the principles of quantum mechanics. As quantum hardware and algorithms continue to advance, the development of high-quality quantum software has become crucial. However, testing quantum programs poses unique challenges due to the distinctive characteristics of quantum systems and the complexity of multi-subroutine programs. In this paper, we address the specific testing requirements of multi-subroutine quantum programs. We begin by investigating critical properties through a survey of existing quantum libraries, providing insights into the challenges associated with testing these programs. Building upon this understanding, we present a systematic testing process tailored to the intricacies of quantum programming. The process covers unit testing and integration testing, with a focus on aspects such as IO analysis, quantum relation checking, structural testing, behavior testing, and test case generation. We also introduce novel testing principles and criteria to guide the testing process. To evaluate our proposed approach, we conduct comprehensive testing on typical quantum subroutines, including diverse mutations and randomized inputs. The analysis of failures provides valuable insights into the effectiveness of our testing methodology. Additionally, we present case studies on representative multi-subroutine quantum programs, demonstrating the practical application and effectiveness of our proposed testing processes, principles, and criteria.Comment: 53 page

    Undergraduate and Graduate Course Descriptions, 2023 Spring

    Get PDF
    Wright State University undergraduate and graduate course descriptions from Spring 2023

    Notes on Quantum Computation and Information

    Full text link
    We discuss fundamentals of quantum computing and information - quantum gates, circuits, algorithms, theorems, error correction, and provide collection of QISKIT programs and exercises for the interested reader.Comment: v2: 86 pages, 97 references. Refined the text, fixed several typos, added some text on continuous variables, and added few solved example problems. v1: 72 pages, 76 references. Suggestions, comments, and corrections are very welcome

    The Importance of Quantum Information in the Stock Market and Financial Decision Making in Conditions of Radical Uncertainty

    Get PDF
    The Universe is a coin that’s already been flipped, heads or tails predetermined: all we’re doing is uncovering it the ‘paradox’ is only a conflict between reality and your feeling of what reality ‘ought to be’.Richard FeynmanThe aim of the research takes place through two parallel directions. The first is gaining an understanding of the applicability of quantum mechanics/quantum physics to human decision-making processes in the stock market with quantum information as a decision-making lever, and the second direction is neuroscience and artificial intelligence using postulates analogous to the postulates of quantum mechanics and radical uncertainty in conditions of radical uncertainty.The world of radical uncertainty (radical uncertainty is based on the knowledge of quantum mechanics from the claim that there is no causal certainty). it is everywhere in our world. "Radical uncertainty is characterized by vagueness, ignorance, indeterminacy, ambiguity and lack of information. He prefers to create 'mysteries' rather than 'puzzles' with defined solutions. Mysteries are ill-defined problems in which action is required, but the future is uncertain, the consequences unpredictable, and disagreement inevitable. "How should we make decisions in these circumstances?" (J. Kay and M. King, 2020), while "uncertainty and ambiguity are at the very core of the stock market. "Narratives are the currency of uncertainty" (N. Mangee, 2022)

    The Importance of Quantum Information in the Stock Market and Financial Decision Making in Conditions of Radical Uncertainty

    Get PDF
    The Universe is a coin that’s already been flipped, heads or tails predetermined: all we’re doing is uncovering it the ‘paradox’ is only a conflict between reality and your feeling of what reality ‘ought to be’.Richard FeynmanThe aim of the research takes place through two parallel directions. The first is gaining an understanding of the applicability of quantum mechanics/quantum physics to human decision-making processes in the stock market with quantum information as a decision-making lever, and the second direction is neuroscience and artificial intelligence using postulates analogous to the postulates of quantum mechanics and radical uncertainty in conditions of radical uncertainty.The world of radical uncertainty (radical uncertainty is based on the knowledge of quantum mechanics from the claim that there is no causal certainty). it is everywhere in our world. "Radical uncertainty is characterized by vagueness, ignorance, indeterminacy, ambiguity and lack of information. He prefers to create 'mysteries' rather than 'puzzles' with defined solutions. Mysteries are ill-defined problems in which action is required, but the future is uncertain, the consequences unpredictable, and disagreement inevitable. "How should we make decisions in these circumstances?" (J. Kay and M. King, 2020), while "uncertainty and ambiguity are at the very core of the stock market. "Narratives are the currency of uncertainty" (N. Mangee, 2022)

    Quantum Cyber-Attack on Blockchain-based VANET

    Full text link
    Blockchain-based Vehicular Ad-hoc Network (VANET) is widely considered as secure communication architecture for a connected transportation system. With the advent of quantum computing, there are concerns regarding the vulnerability of this architecture against cyber-attacks. In this study, a potential threat is investigated in a blockchain-based VANET, and a corresponding quantum cyber-attack is developed. Specifically, a quantum impersonation attack using Quantum-Shor algorithm is developed to break the Rivest-Shamir-Adleman (RSA) encrypted digital signatures of VANET and thus create a threat for the trust-based blockchain scheme of VANET. A blockchain-based VANET, vehicle-to-everything (V2X) communication, and vehicular mobility are simulated using OMNET++, the extended INET library, and vehicles-in-network simulation (VEINS) along with simulation of urban mobility (SUMO), respectively. A small key RSA based message encryption is implemented using IBM Qiskit, which is an open-source quantum software development kit. The findings reveal that the quantum cyber-attack, example, impersonation attack is able to successfully break the trust chain of a blockchain-based VANET. This highlights the need for a quantum secured blockchain.Comment: This paper consists of 10 pages with 7 figures. It has been submitted to IEEE Internet of Things Journa

    Jornadas Nacionales de Investigación en Ciberseguridad: actas de las VIII Jornadas Nacionales de Investigación en ciberseguridad: Vigo, 21 a 23 de junio de 2023

    Get PDF
    Jornadas Nacionales de Investigación en Ciberseguridad (8ª. 2023. Vigo)atlanTTicAMTEGA: Axencia para a modernización tecnolóxica de GaliciaINCIBE: Instituto Nacional de Cibersegurida

    Large-Scale Simulation of Shor's Quantum Factoring Algorithm

    Full text link
    Shor's factoring algorithm is one of the most anticipated applications of quantum computing. However, the limited capabilities of today's quantum computers only permit a study of Shor's algorithm for very small numbers. Here we show how large GPU-based supercomputers can be used to assess the performance of Shor's algorithm for numbers that are out of reach for current and near-term quantum hardware. First, we study Shor's original factoring algorithm. While theoretical bounds suggest success probabilities of only 3-4 %, we find average success probabilities above 50 %, due to a high frequency of "lucky" cases, defined as successful factorizations despite unmet sufficient conditions. Second, we investigate a powerful post-processing procedure, by which the success probability can be brought arbitrarily close to one, with only a single run of Shor's quantum algorithm. Finally, we study the effectiveness of this post-processing procedure in the presence of typical errors in quantum processing hardware. We find that the quantum factoring algorithm exhibits a particular form of universality and resilience against the different types of errors. The largest semiprime that we have factored by executing Shor's algorithm on a GPU-based supercomputer, without exploiting prior knowledge of the solution, is 549755813701 = 712321 * 771781. We put forward the challenge of factoring, without oversimplification, a non-trivial semiprime larger than this number on any quantum computing device.Comment: differs from the published version in formatting and style; open source code available at https://jugit.fz-juelich.de/qip/shorgp

    Quantum Algorithms for Attacking Hardness Assumptions in Classical and Post‐Quantum Cryptography

    Get PDF
    In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post-quantum secure cryptosystems. The authors provide details on the cost of the quantum algorithms presented in this survey. The authors furthermore discuss ongoing research directions that can impact quantum cryptanalysis in the future
    corecore