Pub Date : 2023-05-01DOI: 10.1109/Q-SE59154.2023.00009
Héctor D. Menéndez, Luciano Bello, David Clark
Quantum computers promise a potentially disruptive approach to improving computation in fields such as physics, chemistry, cryptography, optimisation, and machine learning. However, testing quantum computations for faults is currently impractical because of the existence of noise and errors associated with the output. Executing in a quantum system a circuit with only a few valid output states can generate a significant number of implausible states that have zero probability in an ideal computation. Among other sources of noise, readout errors come from the difficulty of discriminating a measurement between 0 and 1 for the different qubits. These issues are affected by readout drift, requiring regular recalibration of the process. In this paper, we provide a novel technique for post-computation analysis of the output probability distributions that permits better discrimination of kerneled data, delaying the need for recalibration. We achieve this by altering the linear discrimination of the final output states by way of a dynamic state selection process that combines Gaussian mixture models with a probability threshold. As an initial assessment of the technique we examine its effect on three to five qubits GHZ states. Our results on almost every one of nine IBM quantum computers show that the number of implausible states is reduced significantly and that the resulting probability distribution is closer to the expected one.
{"title":"Dynamic Output State Classification for Quantum Computers","authors":"Héctor D. Menéndez, Luciano Bello, David Clark","doi":"10.1109/Q-SE59154.2023.00009","DOIUrl":"https://doi.org/10.1109/Q-SE59154.2023.00009","url":null,"abstract":"Quantum computers promise a potentially disruptive approach to improving computation in fields such as physics, chemistry, cryptography, optimisation, and machine learning. However, testing quantum computations for faults is currently impractical because of the existence of noise and errors associated with the output. Executing in a quantum system a circuit with only a few valid output states can generate a significant number of implausible states that have zero probability in an ideal computation. Among other sources of noise, readout errors come from the difficulty of discriminating a measurement between 0 and 1 for the different qubits. These issues are affected by readout drift, requiring regular recalibration of the process. In this paper, we provide a novel technique for post-computation analysis of the output probability distributions that permits better discrimination of kerneled data, delaying the need for recalibration. We achieve this by altering the linear discrimination of the final output states by way of a dynamic state selection process that combines Gaussian mixture models with a probability threshold. As an initial assessment of the technique we examine its effect on three to five qubits GHZ states. Our results on almost every one of nine IBM quantum computers show that the number of implausible states is reduced significantly and that the resulting probability distribution is closer to the expected one.","PeriodicalId":276685,"journal":{"name":"2023 IEEE/ACM 4th International Workshop on Quantum Software Engineering (Q-SE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126484296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.1109/Q-SE59154.2023.00012
Joshua Ammermann, Tim Bittner, Domenik Eichhorn, Ina Schaefer, C. Seidl
A software product line models the variability of highly configurable systems. Complete exploration of all valid configurations (the configuration space) is infeasible as it grows exponentially with the number of features in the worst case. In practice, few representative configurations are sampled instead, which may be used for software testing or hardware verification. Pseudo-randomness of modern computers introduces statistical bias into these samples. Quantum computing enables truly random, uniform configuration sampling based on inherently random quantum physical effects. We propose a method to encode the entire configuration space in a superposition and then measure one random sample. We show the method's uniformity over multiple samples and investigate its scale for different feature models. We discuss the possibilities and limitations of quantum computing for uniform random sampling regarding current and future quantum hardware.
{"title":"Can Quantum Computing Improve Uniform Random Sampling of Large Configuration Spaces?","authors":"Joshua Ammermann, Tim Bittner, Domenik Eichhorn, Ina Schaefer, C. Seidl","doi":"10.1109/Q-SE59154.2023.00012","DOIUrl":"https://doi.org/10.1109/Q-SE59154.2023.00012","url":null,"abstract":"A software product line models the variability of highly configurable systems. Complete exploration of all valid configurations (the configuration space) is infeasible as it grows exponentially with the number of features in the worst case. In practice, few representative configurations are sampled instead, which may be used for software testing or hardware verification. Pseudo-randomness of modern computers introduces statistical bias into these samples. Quantum computing enables truly random, uniform configuration sampling based on inherently random quantum physical effects. We propose a method to encode the entire configuration space in a superposition and then measure one random sample. We show the method's uniformity over multiple samples and investigate its scale for different feature models. We discuss the possibilities and limitations of quantum computing for uniform random sampling regarding current and future quantum hardware.","PeriodicalId":276685,"journal":{"name":"2023 IEEE/ACM 4th International Workshop on Quantum Software Engineering (Q-SE)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127601034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.1109/Q-SE59154.2023.00008
P. Codognet
We consider the problem of generating binary matrices with fixed sums for their rows and columns coefficients, i.e. with fixed margins. Such presence-absence (0/1) matrices are widely used in ecological research, for instance to represent the presence or absence of particular species in a particular habitat. Generating random matrices with fixed sums for their rows and their columns is an important issue in order to compare some given matrix presenting field data versus randomly generated matrices with similar characteristics (same sums on rows and columns) in order to test some hypothesis, i.e. when performing null model statistical analysis. We propose to model this problem in QUBO (Quadratic Unconstrained Binary Optimization) in order to solve it by quantum annealing. QUBO is the input language of quantum computers based on quantum annealing such as the D-Wave systems and of “quantum-inspired” annealing solvers based on dedicated classical hardware. We present some experimental results achieved on the D-Wave Advantage quantum computer and on the Fixstars Amplify Annealing Engine.
{"title":"Generating Presence-Absence Matrices by Quantum Annealing","authors":"P. Codognet","doi":"10.1109/Q-SE59154.2023.00008","DOIUrl":"https://doi.org/10.1109/Q-SE59154.2023.00008","url":null,"abstract":"We consider the problem of generating binary matrices with fixed sums for their rows and columns coefficients, i.e. with fixed margins. Such presence-absence (0/1) matrices are widely used in ecological research, for instance to represent the presence or absence of particular species in a particular habitat. Generating random matrices with fixed sums for their rows and their columns is an important issue in order to compare some given matrix presenting field data versus randomly generated matrices with similar characteristics (same sums on rows and columns) in order to test some hypothesis, i.e. when performing null model statistical analysis. We propose to model this problem in QUBO (Quadratic Unconstrained Binary Optimization) in order to solve it by quantum annealing. QUBO is the input language of quantum computers based on quantum annealing such as the D-Wave systems and of “quantum-inspired” annealing solvers based on dedicated classical hardware. We present some experimental results achieved on the D-Wave Advantage quantum computer and on the Fixstars Amplify Annealing Engine.","PeriodicalId":276685,"journal":{"name":"2023 IEEE/ACM 4th International Workshop on Quantum Software Engineering (Q-SE)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116395884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-04-11DOI: 10.1109/Q-SE59154.2023.00013
Shangzhou Xia, Jianjun Zhao
Quantum entanglement plays a crucial role in quantum computing. Entangling information has important implications for understanding the behavior of quantum programs and avoiding entanglement-induced errors. Entanglement analysis is a static code analysis technique that determines which qubit may entangle with another qubit and establishes an entanglement graph to represent the whole picture of interactions between entangled qubits. This paper presents the first static entanglement analysis method for quantum programs developed in the practical quantum programming language Q#. Our method first constructs an interprocedural control flow graph (ICFG) for a Q# program and then calculates the entanglement information not only within each module but also between modules of the program. The analysis results can help improve the reliability and security of quantum programs.
{"title":"Static Entanglement Analysis of Quantum Programs","authors":"Shangzhou Xia, Jianjun Zhao","doi":"10.1109/Q-SE59154.2023.00013","DOIUrl":"https://doi.org/10.1109/Q-SE59154.2023.00013","url":null,"abstract":"Quantum entanglement plays a crucial role in quantum computing. Entangling information has important implications for understanding the behavior of quantum programs and avoiding entanglement-induced errors. Entanglement analysis is a static code analysis technique that determines which qubit may entangle with another qubit and establishes an entanglement graph to represent the whole picture of interactions between entangled qubits. This paper presents the first static entanglement analysis method for quantum programs developed in the practical quantum programming language Q#. Our method first constructs an interprocedural control flow graph (ICFG) for a Q# program and then calculates the entanglement information not only within each module but also between modules of the program. The analysis results can help improve the reliability and security of quantum programs.","PeriodicalId":276685,"journal":{"name":"2023 IEEE/ACM 4th International Workshop on Quantum Software Engineering (Q-SE)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127770463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-04-10DOI: 10.1109/Q-SE59154.2023.00014
Pengzhan Zhao, Xiongfei Wu, Zhuo Li, Jianjun Zhao
Static analysis is the process of analyzing software code without executing the software. It can help find bugs and potential problems in software that may only appear at runtime. Although many static analysis tools have been developed for classical software, due to the nature of quantum programs, these existing tools are unsuitable for analyzing quantum programs. This paper presents QChecker, a static analysis tool that supports finding bugs in quantum programs in Qiskit. QChecker consists of two main modules: a module for extracting program information based on abstract syntax tree (AST), and a module for detecting bugs based on patterns. We evaluate the performance of QChecker using the Bugs4Q benchmark. The evaluation results show that QChecker can effectively detect various bugs in quantum programs.
{"title":"QChecker: Detecting Bugs in Quantum Programs via Static Analysis","authors":"Pengzhan Zhao, Xiongfei Wu, Zhuo Li, Jianjun Zhao","doi":"10.1109/Q-SE59154.2023.00014","DOIUrl":"https://doi.org/10.1109/Q-SE59154.2023.00014","url":null,"abstract":"Static analysis is the process of analyzing software code without executing the software. It can help find bugs and potential problems in software that may only appear at runtime. Although many static analysis tools have been developed for classical software, due to the nature of quantum programs, these existing tools are unsuitable for analyzing quantum programs. This paper presents QChecker, a static analysis tool that supports finding bugs in quantum programs in Qiskit. QChecker consists of two main modules: a module for extracting program information based on abstract syntax tree (AST), and a module for detecting bugs based on patterns. We evaluate the performance of QChecker using the Bugs4Q benchmark. The evaluation results show that QChecker can effectively detect various bugs in quantum programs.","PeriodicalId":276685,"journal":{"name":"2023 IEEE/ACM 4th International Workshop on Quantum Software Engineering (Q-SE)","volume":"7 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131874194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-31DOI: 10.1109/Q-SE59154.2023.00010
Masaomi Yamaguchi, Nobukazu Yoshioka
To realize reliable quantum software, techniques to automatically ensure the quantum software's correctness have recently been investigated. However, they primarily focus on fixed quantum circuits rather than the procedure of building quantum circuits. Despite being a common approach, the correctness of building circuits using different parameters following the same procedure is not guaranteed. To this end, we propose a design-by-contract framework for quantum software. Our framework provides a python-embedded language to write assertions on the input and output states of all quantum circuits built by certain procedures. Additionally, it provides a method to write assertions about the statistical processing of measurement results to ensure the procedure's correctness for obtaining the final result. These assertions are automatically checked using a quantum computer simulator. For evaluation, we implemented our framework and wrote assertions for some widely used quantum algorithms. Consequently, we found that our framework has sufficient expressive power to verify the whole procedure of quantum software.
{"title":"Design by Contract Framework for Quantum Software","authors":"Masaomi Yamaguchi, Nobukazu Yoshioka","doi":"10.1109/Q-SE59154.2023.00010","DOIUrl":"https://doi.org/10.1109/Q-SE59154.2023.00010","url":null,"abstract":"To realize reliable quantum software, techniques to automatically ensure the quantum software's correctness have recently been investigated. However, they primarily focus on fixed quantum circuits rather than the procedure of building quantum circuits. Despite being a common approach, the correctness of building circuits using different parameters following the same procedure is not guaranteed. To this end, we propose a design-by-contract framework for quantum software. Our framework provides a python-embedded language to write assertions on the input and output states of all quantum circuits built by certain procedures. Additionally, it provides a method to write assertions about the statistical processing of measurement results to ensure the procedure's correctness for obtaining the final result. These assertions are automatically checked using a quantum computer simulator. For evaluation, we implemented our framework and wrote assertions for some widely used quantum algorithms. Consequently, we found that our framework has sufficient expressive power to verify the whole procedure of quantum software.","PeriodicalId":276685,"journal":{"name":"2023 IEEE/ACM 4th International Workshop on Quantum Software Engineering (Q-SE)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127621390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-13DOI: 10.1109/Q-SE59154.2023.00011
Javier Sanchez-Rivero, Daniel Talav'an, J. García-Alonso, Antonio Ruiz-Cort'es, J. M. Murillo
Grover's algorithm is a well-known contribution to quantum computing. It searches one value within an unordered sequence faster than any classical algorithm. A fundamental part of this algorithm is the so-called oracle, a quantum circuit that marks the quantum state corresponding to the desired value. A generalization of it is the oracle for Amplitude Amplification, that marks multiple desired states. In this work we present a classical algorithm that builds a phase-marking oracle for Amplitude Amplification. This oracle performs a less-than operation, marking states representing natural numbers smaller than a given one. Results of both simulations and experiments are shown to prove its functionality. This less-than oracle implementation works on any number of qubits and does not require any ancilla qubits. Regarding depth, the proposed implementation is compared with the one generated by Qiskit automatic method, UnitaryGate. We show that the depth of our less-than oracle implementation is always lower. This difference is significant enough for our method to outperform UnitaryGate on real quantum hardware.
{"title":"Automatic Generation of an Efficient Less-Than Oracle for Quantum Amplitude Amplification","authors":"Javier Sanchez-Rivero, Daniel Talav'an, J. García-Alonso, Antonio Ruiz-Cort'es, J. M. Murillo","doi":"10.1109/Q-SE59154.2023.00011","DOIUrl":"https://doi.org/10.1109/Q-SE59154.2023.00011","url":null,"abstract":"Grover's algorithm is a well-known contribution to quantum computing. It searches one value within an unordered sequence faster than any classical algorithm. A fundamental part of this algorithm is the so-called oracle, a quantum circuit that marks the quantum state corresponding to the desired value. A generalization of it is the oracle for Amplitude Amplification, that marks multiple desired states. In this work we present a classical algorithm that builds a phase-marking oracle for Amplitude Amplification. This oracle performs a less-than operation, marking states representing natural numbers smaller than a given one. Results of both simulations and experiments are shown to prove its functionality. This less-than oracle implementation works on any number of qubits and does not require any ancilla qubits. Regarding depth, the proposed implementation is compared with the one generated by Qiskit automatic method, UnitaryGate. We show that the depth of our less-than oracle implementation is always lower. This difference is significant enough for our method to outperform UnitaryGate on real quantum hardware.","PeriodicalId":276685,"journal":{"name":"2023 IEEE/ACM 4th International Workshop on Quantum Software Engineering (Q-SE)","volume":"379 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134500446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-22DOI: 10.1109/Q-SE59154.2023.00007
Aidan Evans, S. Omonije, Robert Soul'e, Robert Rand
This work introduces MCBeth, a quantum programming language that bridges the gap between near-term and non-near-term languages. MCBeth allows users to directly program and simulate measurement-based computation by building upon the measurement calculus. While MCBeth programs are meant to be executed directly on hardware, to take advantage of current machines we also provide a compiler to gate-based instruction sets. We argue that MCBeth is more natural to use than common low-level languages, which are based upon the quantum circuit model, but still easily runnable in practice.
{"title":"MCBeth: A Measurement-based Quantum Programming Language","authors":"Aidan Evans, S. Omonije, Robert Soul'e, Robert Rand","doi":"10.1109/Q-SE59154.2023.00007","DOIUrl":"https://doi.org/10.1109/Q-SE59154.2023.00007","url":null,"abstract":"This work introduces MCBeth, a quantum programming language that bridges the gap between near-term and non-near-term languages. MCBeth allows users to directly program and simulate measurement-based computation by building upon the measurement calculus. While MCBeth programs are meant to be executed directly on hardware, to take advantage of current machines we also provide a compiler to gate-based instruction sets. We argue that MCBeth is more natural to use than common low-level languages, which are based upon the quantum circuit model, but still easily runnable in practice.","PeriodicalId":276685,"journal":{"name":"2023 IEEE/ACM 4th International Workshop on Quantum Software Engineering (Q-SE)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115095598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：