Related papers: On the complexity of approximating the diamond nor…
Quantum metrology makes use of coherent superpositions to detect weak signals. While in principle the sensitivity can be improved by increasing the density of sensing particles, in practice this improvement is severely hindered by…
This note starts with a recapitulation of what people call the ``Measurement Problem'' of Quantum Mechanics (QM). The dissipative nature of the quantum-mechanical time-evolution of averages of states over large ensembles of identical…
We propose a new simple and natural algorithm for learning the optimal Q-value function of a discounted-cost Markov Decision Process (MDP) when the transition kernels are unknown. Unlike the classical learning algorithms for MDPs, such as…
During the past decade, interest has grown significantly in developing ultrasensitive widefield diamond magnetometry for various applications. Despite attempts to improve the adoption of conventional frame-based sensors, achieving high…
Quantum computers will allow calculations beyond existing classical computers. However, current technology is still too noisy and imperfect to construct a universal digital quantum computer with quantum error correction. Inspired by the…
The concept of number is fundamental to the formulation of any physical theory. We give a heuristic motivation for the reformulation of Quantum Mechanics in terms of non-standard real numbers called Quantum Real Numbers. The standard axioms…
The quantum approximate optimisation algorithm was proposed as a heuristic method for solving combinatorial optimisation problems on near-term quantum computers and may be among the first algorithms to perform useful computations in the…
Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the…
The intersection of quantum theory and accounting presents a novel and intriguing frontier in exploring financial valuation and accounting practices. This paper applies quantum theory to cost accounting, specifically Work in Progress (WIP)…
We argue that the many-worlds of quantum mechanics and the many worlds of the multiverse are the same thing, and that the multiverse is necessary to give exact operational meaning to probabilistic predictions from quantum mechanics.…
A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum…
Fault-tolerant quantum computation traditionally incurs substantial resource overhead, with both qubit and time overheads scaling polylogarithmically with the size of the computation. While prior work by Gottesman showed that constant qubit…
Quantum computing is powerful because unitary operators describing the time-evolution of a quantum system have exponential size in terms of the number of qubits present in the system. We develop a new "Singular value transformation"…
Experiments with individual trapped ions are ideally suited to investigate fundamental issues of quantum mechanics such as the measurement process. At the same time electrodynamically trapped ions have been used with great success to…
Measurement in quantum mechanics is generally described as an irreversible process that perturbs the wavefunction describing a quantum system. In this work we establish a formal connection between the measurement description within the…
Diamond is studied by path integral molecular dynamics simulations of the atomic nuclei in combination with a tight-binding Hamiltonian to describe its electronic structure and total energy. This approach allows us to quantify the influence…
Monte Carlo integration approximates an integral of a black-box function by taking the average of many evaluations (i.e., samples) of the function (integrand). For $N$ queries of the integrand, Monte Carlo integration achieves the…
Eigenvalue transformations appear ubiquitously in scientific computation, ranging from matrix polynomials to differential equations, and are beyond the reach of the quantum singular value transformation framework. In this work, we study the…
Qubit readout is commonly performed by thresholding a collection of analog detector signals to obtain a sequence of single-shot bit values. The intrinsic irreversibility of the mapping from analog to digital signals discards soft…
Understanding quantum speed-up over classical computing is fundamental for the development of efficient quantum algorithms. In this paper, we study such problem within the framework of the Quantum Query Model, which represents the…