Related papers: Variance of the sum of independent quantum computi…
The central challenge in building a quantum computer is error correction. Unlike classical bits, which are susceptible to only one type of error, quantum bits ("qubits") are susceptible to two types of error, corresponding to flips of the…
Expectation values of physical quantities may accurately be obtained by the evaluation of integrals within Many-Body Quantum mechanics, and these multi-dimensional integrals may be estimated using Monte Carlo methods. In a previous…
We establish a connection between continuous-variable quantum computing and high-dimensional integration by showing that the outcome probabilities of continuous-variable instantaneous quantum polynomial (CV-IQP) circuits are given by…
We study the structure and learnability of sums of independent integer random variables (SIIRVs). For $k \in \mathbb{Z}_{+}$, a $k$-SIIRV of order $n \in \mathbb{Z}_{+}$ is the probability distribution of the sum of $n$ independent random…
Motivated from the theory of quantum error correcting codes, we investigate a combinatorial problem that involves a symmetric $n$-vertices colourable graph and a group of operations (colouring rules) on the graph: find the minimum sequence…
Quantum processors can already execute tasks beyond the reach of classical simulation, albeit for artificial problems. At this point, it is essential to design error metrics that test the experimental accuracy of quantum algorithms with…
In this paper, we obtain error bound for binomial and negative binomial approximations to weighted sums of locally dependent random variables, using Stein's method. We also discuss approximation results for weighted sums of independent…
Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available,…
Quantum state exclusion is an operational task with application to ontological interpretations of quantum states. In such a task, one is given a system whose state is randomly selected from a finite set, and the goal is to identify a state…
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…
The coefficient of variation is a useful indicator for comparing the spread of values between dataset with different units or widely different means. In this paper we address the problem of investigating the equality of the coefficients of…
Eigenstate preparation is ubiquitous in quantum computing, and a standard approach for generating the lowest-energy states of a given system is by employing adiabatic state preparation (ASP). In the present work, we investigate a…
The increasing complexity of quantum software presents significant challenges for software verification and validation, particularly in the context of unit testing. This work presents a comprehensive study on quantum-centric unit tests,…
The discovery of quantum error correction has greatly improved the long-term prospects for quantum computing technology. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the…
Quantum computing has been increasingly applied in nuclear physics. In this work, we combine quantum computing with the complex scaling method to address the resonance problem. Due to the non-Hermiticity introduced by complex scaling,…
Quantum computing is one of the most promising technology advances of the latest years. Once only a conceptual idea to solve physics simulations, quantum computation is today a reality, with numerous machines able to execute quantum…
Error-correction process has to be carried out periodically to prevent accumulation of errors in fault-tolerant quantum computation. It is believed that the best choice to get maximum threshold value is carrying out an error-correction…
We study numerically the effects of static imperfections and residual couplings between qubits for the quantum phase estimation algorithm with two qubits. We show that the success probability of the algorithm is affected significantly more…
Classical optimization is a cornerstone of the success of variational quantum algorithms, which often require determining the derivatives of the cost function relative to variational parameters. The computation of the cost function and its…
We show that a lower bound for covariance of $\min(X_1,X_2)$ and $\max(X_1,X_2)$ is $\cov{X_1}{X_2}$ and an upper bound for variance of \\ $\min(X_2,\max(X,X_1))$ is $\var{X} + \var{X_1} +\var{X_2}$ generalizing previous results. We also…