Related papers: Efficient quantum circuits for high-dimensional re…
Hybrid quantum systems combine the unique advantages of different physical platforms with the goal of realizing more powerful and practical quantum information processing devices. Mechanical systems, such as bulk acoustic wave resonators,…
High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to the intrinsic operational robustness, quantum manipulation induced by geometric phases is one of the promising candidates. However,…
Lattice gauge theories in varying dimensions, lattice volumes, and truncations offer a rich family of targets for Hamiltonian simulation on quantum devices. In return, formulating quantum simulations can provide new ways of thinking about…
Superconducting circuits consisting of a few low-anharmonic transmons coupled to readout and bus resonators can perform basic quantum computations. Since the number of qubits in such circuits is limited to not more than a few tens, the…
An improved mapping of one-dimensional SU(2) non-Abelian gauge theory onto qubit degrees of freedom is presented. This new mapping allows for a reduced unphysical Hilbert space. Insensitivity to interactions within this unphysical space is…
Nonlinear spectroscopy is a cornerstone of quantum science, providing unique access to multi-point correlations, quantum coherence, and couplings that are invisible to linear methods. However, classical simulation of these phenomena is…
We present a novel implementation of an n-qubit fanout gate using resonance engineering. Our proposed mechanism uses Jaynes-Cummings interactions between multiple qubits and a common harmonic oscillator to realize a fanout gate at the…
Quantum computers have the potential to efficiently simulate the dynamics of nanoscale NMR systems. In this work we demonstrate that a noisy intermediate-scale quantum computer can be used to simulate and predict nanoscale NMR resonances.…
The Hermiticity axiom of quantum mechanics guarantees that the energy spectrum is real and the time evolution is unitary (probability-preserving). Nevertheless, non-Hermitian but $\mathcal{PT}$-symmetric Hamiltonians may also have real…
Building on the established methods for superconducting circuit quantization, we present a new theoretical framework for approximate numerical simulation of Josephson quantum circuits. Simulations based on this framework provide access to a…
Rational functions are exceptionally powerful tools in scientific computing, yet their abilities to advance quantum algorithms remain largely untapped. In this paper, we introduce effective implementations of rational transformations of a…
Increasing the quantum information processing power with limited number of hosts is vital for achieving quantum advantage. Here we propose a novel scheme that achieves a scalable n-ion-2n-qubit quantum processor utilizing four internal…
High-dimensional photonic systems access large Hilbert spaces for quantum information processing. They offer proven advantages in quantum computation, communication, and sensing. However, implementing scalable, low-loss unitary gates across…
We propose an efficient protocol for digital quantum simulation of quantum chemistry problems and enhanced digital-analog quantum simulation of transport phenomena in biomolecules with superconducting circuits. Along these lines, we…
Let G(A,B) denote the 2-qubit gate which acts as the 1-qubit SU(2) gates A and B in the even and odd parity subspaces respectively, of two qubits. Using a Clifford algebra formalism we show that arbitrary uniform families of circuits of…
We develop a hardware-efficient ansatz for variational optimization, derived from existing ansatze in the literature, that parametrizes subsets of all interactions in the Cost Hamiltonian in each layer. We treat gate orderings as a…
Arithmetic operations are an important component of many quantum algorithms. As such, coming up with optimized quantum circuits for these operations leads to more efficient implementations of the corresponding algorithms. In this paper, we…
In this paper, we report efficient quantum circuits for integer multiplication using Toom-Cook algorithm. By analysing the recursive tree structure of the algorithm, we obtained a bound on the count of Toffoli gates and qubits. These bounds…
Simulating quantum circuits is a computationally intensive task that relies heavily on tensor products and matrix multiplications, which can be inefficient. Recent advancements, eliminate the need for tensor products and matrix…
The synthesis approaches for quantum circuits typically aim at minimizing the number of lines or gates. Given the tight restrictions on those logical resources in physical implementations, we propose to view the problem fundamentally…