Related papers: Pathfinding Quantum Simulations of Neutrinoless Do…
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…
Neutral atom arrays have recently emerged as a promising platform for quantum information processing. One important remaining roadblock for the large-scale application of these systems is the ability to perform error-corrected quantum…
Quantum computing represents a central challenge in modern science. Neutral atoms in optical lattices have emerged as a leading computing platform, with collisional gates offering a stable mechanism for quantum logic. However, previous…
Efficient representations of the Hamiltonian such as double factorization drastically reduce circuit depth or number of repetitions in error corrected and noisy intermediate scale quantum (NISQ) algorithms for chemistry. We report a…
Neutrinoless double beta decay (0v2b) has been investigated as a physical process that can provide evidence for the Majorana nature of neutrinos. The theoretical predictions of the 0v2b rate are subject to significant uncertainty, primarily…
Anharmonic potential quantum system play crucial role in physics as they provide a more realistic description of oscillatory phenomena, which often deviate from the idealized harmonic model. However, simulating such system on classical…
The family of $n$-bit Toffoli gates, with the two-bit Toffoli gate as the figurehead, are of great interest in quantum information as they can be used as universal gates and in quantum error correction, among other things. We present a…
Quantum chemistry simulations that accurately predict the properties of materials are among the most highly anticipated applications of quantum computing. It is widely believed that simulations running on quantum computers will allow for…
We study two-neutrino ($2\nu\beta\beta$) and neutrinoless double-$\beta$ ($0\nu\beta\beta$) decays in the nuclear shell model and proton-neutron quasiparticle random-phase approximation (pnQRPA) frameworks. Calculating the decay half-life…
Ion-trap quantum computers offer a large number of possible qubit couplings, each of which requires individual calibration and can be misconfigured. To enhance the duty cycle of an ion trap, we develop a strategy that diagnoses individual…
Fraunhofer FIRST develops a computing service and collaborative workspace providing a convenient tool for simulation and investigation of quantum algorithms. To broaden the twenty qubit limit of workstation-based simulations to the next…
Neutrinoless double beta decay (\( 0 \nu \beta \beta \)) is a hypothetical nuclear decay mode with important implications. In particular, observation of this decay would demonstrate that the neutrino is a Majorana particle and that lepton…
A variety of photon-mediated operations are critical to the realization of scalable quantum information processing platforms and their accurate characterization is essential for the identification of optimal regimes and their experimental…
The nuclear matrix elements (NMEs) of the neutrinoless and two-neutrino double-$\beta$ decays of $^{48}$Ca are calculated by the quasiparticle random-phase approximation (QRPA) with emphasis on the consistency examinations of this…
Quantum bits have technological imperfections. Additionally, the capacity of a component that can be implemented feasibly is limited. Therefore, distributed quantum computation is required to scale up quantum computers. This dissertation…
In this paper, we explore (2+1)D quantum electrodynamics (QED) at finite density on a quantum computer, including two fermion flavors. Our method employs an efficient gauge-invariant ansatz together with a quantum circuit structure that…
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible). Second, do a syndrome measurement on a subset of the…
We report on the fault-tolerant operation of logical qubits on a neutral atom quantum computer, with logical performance surpassing physical performance for multiple circuits including Bell states (12x error reduction), random circuits…
Here we describe an approach for simulating electronic structure on quantum computers with significantly lower asymptotic complexity than prior work. The approach uses a real-space first-quantised representation of the molecular Hamiltonian…
While advances in quantum hardware occur in modest steps, simulators running on classical computers provide a valuable test bed for the construction of quantum algorithms. Given a unitary matrix that performs certain operation, obtaining…