Related papers: Efficient Monte Carlo characterization of quantum …

Monte Carlo evaluation is used to calculate heavy-ion elastic scattering including the center-of-mass correction and the Coulomb interaction.Angular distributions are presented for a number of nuclear pairs over a wide energy range using…

Dynamical triangulations of four-dimensional Euclidean quantum gravity give rise to an interesting, numerically accessible model of quantum gravity. We give a simple introduction to the model and discuss two particularly important issues.…

Complex scientific models where the likelihood cannot be evaluated present a challenge for statistical inference. Over the past two decades, a wide range of algorithms have been proposed for learning parameters in computationally feasible…

An average gate fidelity is a standard performance metric to quantify deviation between an ideal unitary gate transformation and its realistic experimental implementation. The average is taken with respect to states uniformly distributed…

This letter generalizes the expression for the average fidelity of single qubits, as found by Bowdrey et al., to the case of n qubits. We use a simple algebraic approach with basis elements for the density-matrix expansion expressed as…

A quantum Monte Carlo method with non-local update scheme is presented. The method is based on a path-integral decomposition and a worm operator which is local in imaginary time. It generates states with a fixed number of particles and…

Predicting properties of large-scale quantum systems is crucial for the development of quantum science and technology. Shadow estimation is an efficient method for this task based on randomized measurements, where many-qubit random Clifford…

This project investigates the applicability of quasi-Monte Carlo methods to Euclidean lattice systems in order to improve the asymptotic error scaling of observables for such theories. The error of an observable calculated by averaging over…

Fidelity is a fundamental measure for the closeness of two quantum states, which is important both from a theoretical and a practical point of view. Yet, in general, it is difficult to give good estimates of fidelity, especially when one…

The quantum Monte Carlo methods represent a powerful and broadly applicable computational tool for finding very accurate solutions of the stationary Schroedinger equation for atoms, molecules, solids and a variety of model systems. The…

Projective measurements with high quantum efficiency is often assumed to be required for efficient circuit based quantum computing. We argue that this is not the case and show that this fact has actually be known previously though not…

A major challenge in developing quantum computing technologies is to accomplish high precision tasks by utilizing multiplex optimization approaches, on both the physical system and algorithm levels. Loss functions assessing the overall…

We give three new algorithms for efficient in-place estimation, without using ancilla qubits, of average fidelity of a quantum logic gate acting on a d-dimensional system using much fewer random bits than what was known so far. Previous…

We study measurements of the unitary generalization of Pauli operators. First, an analytical (constructive) solution to the eigenproblem of these operators is presented. Next, in the case of two subsystems, the Schmidt form of the…

We show how information on the uniformity properties of a point set employed in numerical multidimensional integration can be used to improve the error estimate over the usual Monte Carlo one. We introduce a new measure of (non-)uniformity…

We perform a comprehensive analysis of the quantum-enhanced Monte Carlo method [Nature, 619, 282-287 (2023)], aimed at identifying the optimal working point of the algorithm. We observe an optimal mixing Hamiltonian strength and analyze the…

Fault-tolerant quantum computing will require accurate estimates of the resource overhead, but standard metrics such as gate fidelity and diamond distance have been shown to be poor predictors of logical performance. We present a scalable…

A reliable method for characterizing quantum operations that is suitable for improving and validating their accuracies is indispensable for realizing a practical quantum computer. Known methods are still not sufficient because they lack…

The celebrated Monte Carlo method estimates an expensive-to-compute quantity by random sampling. Bandit-based Monte Carlo optimization is a general technique for computing the minimum of many such expensive-to-compute quantities by adaptive…

The Clifford group plays a central role in quantum information science. It is the building block for many error-correcting schemes and matches the first three moments of the Haar measure over the unitary group -a property that is essential…