Publication Library

Publication Library

Quantum Testing in the Wild - A Case Study with Qiskit Algorithms

Description: Although classical computing has excelled in a wide range of applications, there remain problems that push the limits of its capabilities, especially in fields like cryptography, optimization, and materials science. Quantum computing introduces a new computational paradigm, based on principles of superposition and entanglement to explore solutions beyond the capabilities of classical computation. With the increasing interest in the field, there are challenges and opportunities for academics and practitioners in terms of software engineering practices, particularly in testing quantum programs. This paper presents an empirical study of testing patterns in quantum algorithms. We analyzed all the tests handling quantum aspects of the implementations in the Qiskit Algorithms library and identified seven distinct patterns that make use of (1) fixed seeds for algorithms based on random elements; (2) deterministic oracles; (3) precise and approximate assertions; (4) Data-Driven Testing (DDT); (5) functional testing; (6) testing for intermediate parts of the algorithms being tested; and (7) equivalence checking for quantum circuits. Our results show a prevalence of classical testing techniques to test the quantum-related elements of the library, while recent advances from the research community have yet to achieve wide adoption among practitioners.

Created At: 18 January 2025

Updated At: 18 January 2025

Minimal Quantum Circuits for Simulating Fibonacci Anyons

Description: The Fibonacci topological order is the prime candidate for the realization of universal topological quantum computation. We devise minimal quantum circuits to demonstrate the non-Abelian nature of the doubled Fibonacci topological order, as realized in the Levin-Wen string net model. Our circuits effectively initialize the ground state, create excitations, twist and braid them, all in the smallest lattices possible. We further design methods to determine the fusion amplitudes and braiding phases of multiple excitations by carrying out a single qubit measurement. We show that the fusion channels of the doubled Fibonacci model can be detected using only three qubits, twisting phases can be measured using five, and braiding can be demonstrated using nine qubits. These designs provide the simplest possible settings for demonstrating the properties of Fibonacci anyons and can be used as realistic blueprints for implementation on many modern quantum architectures.

Created At: 18 January 2025

Updated At: 18 January 2025

Quantum Computing Enhanced Sensing

Description: Quantum computing and quantum sensing represent two distinct frontiers of quantum information science. In this work, we harness quantum computing to solve a fundamental and practically important sensing problem: the detection of weak oscillating fields with unknown strength and frequency. We present a quantum computing enhanced sensing protocol that outperforms all existing approaches. Furthermore, we prove our approach is optimal by establishing the Grover-Heisenberg limit -- a fundamental lower bound on the minimum sensing time. The key idea is to robustly digitize the continuous, analog signal into a discrete operation, which is then integrated into a quantum algorithm. Our metrological gain originates from quantum computation, distinguishing our protocol from conventional sensing approaches. Indeed, we prove that broad classes of protocols based on quantum Fisher information, finite-lifetime quantum memory, or classical signal processing are strictly less powerful. Our protocol is compatible with multiple experimental platforms. We propose and analyze a proof-of-principle experiment using nitrogen-vacancy centers, where meaningful improvements are achievable using current technology. This work establishes quantum computation as a powerful new resource for advancing sensing capabilities.

Created At: 18 January 2025

Updated At: 18 January 2025

Modeling Entanglement-Based Quantum Key Distribution for the NASA Quantum Communications Analysis Suite

Description: One of the most practical, and sought after, applications of quantum mechanics in the field of information science is the use of entanglement distribution to communicate quantum information effectively. Similar to the continued improvements of functional quantum computers over the past decade, advances in demonstrations of entanglement distribution over long distances may enable new applications in aeronautics and space communications. The existing NASA Quantum Communications Analysis Suite (NQCAS) software models such applications, but limited experimental data exists to verify the model's theoretical results. There is, however, a large body of experimental data in the relevant literature for entanglement-based quantum key distribution (QKD). This paper details a Monte Carlo-based QKD model that uses NQCAS input parameters to generate an estimated QKD link budget for verification of NQCAS. The model generates link budget statistics like key rates, error rates, and S values that can then be compared to the experimental values in the literature. Preliminary comparisons show many similarities between the simulated and experimental data, supporting the model's validity. A verified NQCAS model will inform experimental work conducted in Glenn Research Center's (GRC) NASA Quantum Metrology Laboratory (NQML), supporting the United States Quantum Initiative and potential NASA missions.

Created At: 18 January 2025

Updated At: 18 January 2025

Quantum algorithm for the gradient of a logarithm-determinant

Description: The logarithm-determinant is a common quantity in many areas of physics and computer science. Derivatives of the logarithm-determinant compute physically relevant quantities in statistical physics models, quantum field theories, as well as the inverses of matrices. A multi-variable version of the quantum gradient algorithm is developed here to evaluate the derivative of the logarithm-determinant. From this, the inverse of a sparse-rank input operator may be determined efficiently. Measuring an expectation value of the quantum state--instead of all N2 elements of the input operator--can be accomplished in O(kσ) time in the idealized case for k relevant eigenvectors of the input matrix. A factor σ=1ε3 or −1ε2log2ε depends on the version of the quantum Fourier transform used for a precision ε. Practical implementation of the required operator will likely need log2N overhead, giving an overall complexity of O(kσlog2N). The method applies widely and converges super-linearly in k when the condition number is high. For non-sparse-rank inputs, the algorithm can be evaluated provided that an equal superposition of eigenstates is provided. The output is given in O(1) queries of oracle, which is given explicitly here and only relies on time-evolution operators that can be implemented with arbitrarily small error. The algorithm is envisioned for fully error-corrected quantum computers but may be implementable on near-term machines. We discuss how this algorithm can be used for kernel-based quantum machine-learning.

Created At: 18 January 2025

Updated At: 18 January 2025

First 9 10 11 12 13 14 15 Last

DSA Bot

Hello guy😘
I'm here to help you😎
rasa-chatbot-logo