In this paper, we propose quantum circuits for runtime assertions, which can be used for both software debugging and error detection. Runtime assertion is challenging in quantum computing for two key reasons. First, a quantum bit (qubit) cannot be copied, which is known as the non-cloning theorem. Second, when a qubit is measured, its superposition state collapses into a classical state, losing the inherent parallel information. In this paper, we overcome these challenges with runtime computation through ancilla qubits, which are used to indirectly collect the information of the qubits of interest. We design quantum circuits to assert classical states, entanglement, and superposition states. Our experimental results show that they are effective in debugging as well as improving the success rate for various quantum algorithms on IBM Q quantum computers.
High-speed networking technology and standards have progressed dramatically in the past few years and much attention is now focused on deployment efforts, such as the North Carolina Information Highway (NCIH) [7], and applications. With this shift in emphasis, concerns have been raised about information security. Examples of abuse of the Internet abound and unfortunately ATM networks are subject to many of these same abuses. This is of subtanstial concern when thinking about extending the reach of public data networking to broad segments of society.
Challenges and competitions offer a compelling platform for engaging students and lifelong learners in new technologies and skill development. This special issue explores a sampling of challenge-based approaches to education and community outreach.
21 December 2022 in IEEE Transactions on Quantum Engineering
Variational Quantum Algorithms (VQAs) have emerged as a powerful class of algorithms that is highly suitable for noisy quantum devices. Therefore, investigating their design has become key in quantum computing research. Previous works have shown that choosing an effective parameterized quantum circuit (PQC) or ansatz for a VQA is crucial to its overall performance, especially on near-term devices. In this paper, we utilize pulse-level access to quantum machines, our understanding of their two-qubit interactions, and, more importantly, our knowledge of VQAs, to customize the design of two-qubit entanglers. Our analysis shows that utilizing customized pulse gates for ansatze reduces state preparation times by more than half, maintains expressibility relative to standard ansatze, and produces PQCs that are more trainable through local cost function analysis. Our algorithm performance results show that in three cases, our PQC configuration outperforms the base implementation. Experiments using IBM Quantum hardware demonstrate that our pulse-based PQC configurations are more capable of solving MaxCut and Chemistry problems compared to a standard configuration.
14 August 2019 in IEEE Computer Architecture Letters
In this paper, we propose quantum circuits for runtime assertions, which can be used for both software debugging and error detection. Runtime assertion is challenging in quantum computing for two key reasons. First, a quantum bit (qubit) cannot be copied, which is known as the non-cloning theorem. Second, when a qubit is measured, its superposition state collapses into a classical state, losing the inherent parallel information. In this paper, we overcome these challenges with runtime computation through ancilla qubits, which are used to indirectly collect the information of the qubits of interest. We design quantum circuits to assert classical states, entanglement, and superposition states.