Related papers: Programmable generation of arbitrary continuous-va…
Quantum computing has been pursued with various hardware platforms, and an optical system is one of the most reasonable choices for large-scale computation. In the optical continuous-variable computation scheme, the incorporation of…
We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons that avoids the boson-to-qubit mapping overhead encountered in qubit hardware. This framework gives exact…
Variational quantum algorithms have shown promise in numerous fields due to their versatility in solving problems of scientific and commercial interest. However, leading algorithms for Hamiltonian simulation, such as the Variational Quantum…
Dynamic quantum circuits incorporate mid-circuit measurements and feed-forward operations originally intended to realize Quantum Error Correction. This paradigm has recently been utilized to prepare certain states and long-range entangling…
Among existing approaches to holonomic quantum computing, the adiabatic holonomic quantum gates (HQGs) suffer errors due to decoherence, while the non-adiabatic HQGs either require additional Hilbert spaces or are difficult to scale. Here,…
Hybrid quantum systems that combine discrete-variable (DV) and continuous-variable (CV) architectures represent a promising direction in quantum information science. However, transferring concepts, information and states between such…
Simulation of quantum many-body systems is a promising application of quantum computers. However, implementing the time-evolution operator as a quantum circuit efficiently on near-term devices with limited resources is challenging. Standard…
Quantum error correction is essential for robust quantum information processing with noisy devices. As bosonic quantum systems play a crucial role in quantum sensing, communication, and computation, it is important to design error…
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm used to find the ground state of a Hamiltonian using variational methods. In the context of this Lattice symposium, the procedure can be used to study lattice…
Digital-analog quantum computation aims to reduce the currently infeasible resource requirements needed for near-term quantum information processing by replacing sequences of one- and two-qubit gates with a unitary transformation generated…
Continuous-variable (CV) quantum systems offer a natural framework for continuous optimization through their infinite-dimensional Hilbert spaces. In this paper, we propose the Complex Continuous-Variable Quantum Approximate Optimization…
In this study, we propose a new method for constrained combinatorial optimization using variational quantum circuits. Quantum computers are considered to have the potential to solve large combinatorial optimization problems faster than…
Quantum simulations provide means to probe challenging problems within controllable quantum systems. However, implementing or simulating deep-strong nonlinear couplings between bosonic oscillators on physical platforms remains a challenge.…
We propose a method for finding approximate compilations of quantum unitary transformations, based on techniques from policy gradient reinforcement learning. The choice of a stochastic policy allows us to rephrase the optimization problem…
We provide an efficient and general route for preparing non-trivial quantum states that are not adiabatically connected to unentangled product states. Our approach is a hybrid quantum-classical variational protocol that incorporates a…
Homogenous Boolean function is an essential part of any cryptographic system. The ability to construct an optimized reversible circuits for homogeneous Boolean functions might arise the possibility of building cryptographic system on novel…
Quantum algorithms offer a compelling new avenue for addressing difficult NP-complete optimization problems, such as the Generalized Assignment Problem (GAP). Given the operational constraints of contemporary Noisy Intermediate-Scale…
Matching 't Hooft anomalies is a powerful tool for constraining the low-energy dynamics of quantum systems and their allowed renormalization group (RG) flows. For non-invertible (or categorical) symmetries, however, a key challenge has been…
We introduce a novel approach for decomposing and learning every scale of a given multiscale objective function in $\mathbb{R}^d$, where $d\ge 1$. This approach leverages a recently demonstrated implicit bias of the optimization method of…
This article constructs simultaneous confidence bands (SCBs) for functional parameters using the Gaussian Kinematic formula of $t$-processes (tGKF). Although the tGKF relies on Gaussianity, we show that a central limit theorem (CLT) for the…