Related papers: Efficient Hamiltonian programming in qubit arrays …
Quantum algorithms are getting extremely popular due to their potential to significantly outperform classical algorithms. Yet, applying quantum algorithms to optimization problems meets challenges related to the efficiency of quantum…
Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally…
Many-body fermionic quantum calculations performed on analog quantum computers are restricted by the presence of k-local terms, which represent interactions among more than two qubits. These originate from the fermion-to-qubit mapping…
There exist numerous problems in nature inherently described by finite $D$-dimensional states. Formulating these problems for execution on qubit-based quantum hardware requires mapping the qudit Hilbert space to that of multiqubit which may…
Existing quantum systems provide very limited physical qubit counts, trying to execute a quantum algorithm/circuit on them that have a higher number of logical qubits than physically available lead to a compile-time error. Given that it is…
We experimentally investigate the viability of a variational quantum gate optimization protocol informed by the underlying physical Hamiltonian of fixed-frequency transmon qubits. The utility of the scheme is demonstrated through the…
With recent improvements in coherence times, superconducting transmon qubits have become a promising platform for quantum computing. They can be flexibly engineered over a wide range of parameters, but also require us to identify an…
Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…
We have studied quantum systems on finite-dimensional Hilbert spaces and found that all these systems are connected through local transformations. Actually, we have shown that these transformations give rise to a gauge group that connects…
We propose and analyze an approach to realize quantum computation and simulation using fermionic particles under quantum gas microscopes. Our work is inspired by a recent experimental demonstration of large-scale quantum registers, where…
We propose a quantum control scheme aimed at interacting systems that gives rise to highly selective coupling among their near-to-resonance constituents. Our protocol implements temporal control of the interaction strength, switching it on…
We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. In particular, we focus on superconducting platforms and consider a network of qubits -- encoded in the states of artificial atoms…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
In a digital quantum simulator, basic two-qubit interactions are manipulated by means of fast local control operations to establish a desired target Hamiltonian. Here we consider a quantum simulator based on logical systems, i.e. where…
Quantum computing is an emerging technology that has the potential to revolutionize fields such as cryptography, machine learning, optimization, and quantum simulation. However, a major challenge in the realization of quantum algorithms on…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…
Combinatorial problems are formulated to find optimal designs within a fixed set of constraints. They are commonly found across diverse engineering and scientific domains. Understanding how to best use quantum computers for combinatorial…
The optimal control of unitary transformations is a fundamental problem in quantum control theory and quantum information processing. The feasibility of performing such optimizations is determined by the computational and control resources…
Quantum control in large dimensional Hilbert spaces is essential for realizing the power of quantum information processing. For closed quantum systems the relevant input/output maps are unitary transformations, and the fundamental challenge…
As quantum hardware increases in complexity, successful algorithmic execution relies more heavily on awareness of existing device constraints. In this work we focus on the problem of routing quantum information across the machine to…