arXiv subjects

Francesco Cesa

Publications and source records attributed to Francesco Cesa.

9 recordsLinked to original sources

arXiv2026

Programmable Fermionic Quantum Processors with Globally Controlled Lattices

We introduce a framework for realizing universal fermionic quantum processing with globally controlled itinerant fermionic particles. Our approach is tailored to the example of neutral atoms in optical lattices, but transposes to other setups with similar capabilities. We give constructive protocols to realize arbitrary fermionic processes, with time-dependent control over global parameters of the experimental setup, such as tunneling and interaction in a Fermi-Hubbard type model. We first prove the universality of our framework and then discuss implementation variants, such as hybrid analog-digital simulation of extended Fermi-Hubbard models, e.g., with long-range couplings.

quant-ph↗

arXiv2026

Quantum Cellular Automata on a Dual-Species Rydberg Processor

As quantum devices scale to larger and larger sizes, a significant challenge emerges in scaling their coherent controls accordingly. Quantum cellular automata (QCAs) constitute a promising framework that bypasses this control problem: universal dynamics can be achieved using only a static qubit array and global control operations. Despite an extensive history of theoretical explorations and proposals, QCAs have not been experimentally explored in the context of highly-scalable globally-controlled systems. Here we realize QCAs on a dual-species Rydberg array of rubidium and cesium atoms, leveraging independent global control of each species to perform multiple quantum protocols. Seeding an automaton with different initial states, we explore many-body dynamics of quasiparticles and grow GHZ states across both species, highlighting the flexibility of our approach. We further develop a second automaton using a novel mediated entangling gate, enabling generation of 96.7(1.7)%-fidelity Bell states, 17-qubit cluster states, and high-connectivity graph states. Our results demonstrate that simple global controls enable access to a rich variety of applications through the QCA framework. The versatility and scalability of QCAs present compelling opportunities for the development of quantum information systems, as well as new perspectives on quantum many-body dynamics.

quant-ph↗

arXiv2026

Engineering discrete local dynamics in globally driven dual-species atom arrays

We introduce a method for engineering discrete local dynamics in globally-driven dual-species neutral atom experiments, allowing us to study emergent digital models through uniform analog controls. Leveraging the new opportunities offered by dual-species systems, such as species-alternated driving, our construction exploits simple Floquet protocols on static atom arrangements, and benefits of generalized blockade regimes (different inter- and intra-species interactions). We focus on discrete dynamical models that are special examples of Quantum Cellular Automata (QCA), and explicitly consider a number of relevant examples, including the kicked-Ising model, the Floquet Kitaev honeycomb model, and the digitization of generic translation-invariant nearest-neighbor Hamiltonians (e.g., for Trotterized evolution). As an application, we study chaotic features of discretized many-body dynamics that can be detected by leveraging only demonstrated capabilities of globally-driven experiments, and benchmark their ability to discriminate chaotic evolution.

quant-ph↗

arXiv2025

Resource-state Quantum RAM for Fast and Error-Correctable Queries

Quantum devices can process data in a fundamentally different way than classical computers. To leverage this potential, many algorithms require the aid of a quantum Random Access Memory (QRAM), i.e. a module capable of efficiently loading datasets onto the quantum processor. However, a realisation of this building block is still outstanding due to its formidable resource requirements, which become even more demanding in quantum error-correction schemes. Here we show that the challenge of implementing QRAM can be entirely reduced to a state-preparation problem: since such resource-state is independent on the memory, our approach allows one to prepare it offline, opening the door to new design strategies. As an example, we introduce a heralded 'QRAM factory' which enables improved fidelities with high acceptance rate. More broadly, our results introduce the concept of resource-state QRAM: we study its performance in noisy settings, showing that it preserves the noise-resilience of standard QRAM, and discuss how it can be efficiently combined with quantum error-correction. Finally, we propose an implementation with neutral-atom hardware, where our analysis suggests that high-fidelity and low-latency queries can be implemented.

quant-ph↗

arXiv2025

Hierarchical Generation and Design of Tree-Codes for Resource-Efficient Loss-Tolerant Quantum Communications

We develop protocols for generating loss-tolerant quantum tree-codes; these are designed to safeguard information against qubit losses, with wide applications in quantum communications. Contrary to previous proposals, our method enables top-to-bottom fast encoding and decoding, thereby reducing losses due to the lagging and photon-reordering at the repeater stations. At the hardware level, we show how to achieve this with a single quantum emitter equipped with a static feedback mechanism, which we leverage to engineer entangling gates between a fed-back qubit and multiple emitted qubits in parallel. In addition, analyzing typical patterns within the error-correction decoding graphs, we find optimizations of the structure of tree-codes, which enable improved performance by also reducing the code size; these are based on the introduction of asymmetries in the code, which mimic the intrinsic adaptiveness of the recovery procedure. We show numerically that these improvements together significantly enhance the loss-correction performance. Specifically, focusing on quantum repeater protocols, we show that our fast recovery scheme (decoding-encoding) allows for improved repeater rates with smaller photon numbers per code.

quant-ph↗

arXiv2024

Hamilton-Jacobi-Bellman equations for Rydberg-blockade processes

We discuss time-optimal control problems for two setups involving globally driven Rydberg atoms in the blockade limit by deriving the associated Hamilton-Jacobi-Bellman equations. From these equations, we extract the globally optimal trajectories and the corresponding controls for several target processes of the atomic system, using a generalized method of characteristics. We apply this method to retrieve known results for CZ and C-phase gates, and to find new optimal pulses for all elementary processes involved in the universal quantum computation scheme introduced in [Physical Review Letters 131, 170601 (2023)].

quant-ph↗

arXiv2023

Universal Quantum Computation in Globally Driven Rydberg Atom Arrays

We develop a model for quantum computation with Rydberg atom arrays, which only relies on global driving, without the need of local addressing of the qubits: any circuit is executed by a sequence of global, resonant laser pulses on a static atomic arrangement. We present two constructions: for the first, the circuit is imprinted in the trap positions of the atoms and executed by the pulses; for the second, the atom arrangement is circuit-independent, and the algorithm is entirely encoded in the global driving sequence. Our results show in particular that a quadratic overhead in atom number is sufficient to eliminate the need for local control to realize a universal quantum processor. We give explicit protocols for all steps of an arbitrary quantum computation, and discuss strategies for error suppression specific to our model. Our scheme is based on dual-species processors with atoms subjected to Rydberg blockade constraints, but it might be transposed to other setups as well.

quant-ph↗

arXiv2023

A novel approach to noisy gates for simulating quantum computers

We present a novel method for simulating the noisy behaviour of quantum computers, which allows to efficiently incorporate environmental effects in the driven evolution implementing the gates acting on the qubits. We show how to modify the noiseless gate executed by the computer to include any Markovian noise, hence resulting in what we will call a noisy gate. We compare our method with the IBM Qiskit simulator, and show that it follows more closely both the analytical solution of the Lindblad equation as well as the behaviour of a real quantum computer, where we ran algorithms involving up to 18 qubits; as such, our protocol offers a more accurate simulator for NISQ devices. The method is flexible enough to potentially describe any noise, including non-Markovian ones. The noise simulator based on this work is available as a python package at this link: https://pypi.org/project/quantum-gates.

quant-ph↗

arXiv2022

Deploying an inter-European quantum network

Around forty years have passed since the first pioneering works have introduced the possibility of using quantum physics to strongly enhance communications safety. Nowadays Quantum Cryptography, and in particular, Quantum Key Distribution (QKD) exited the physics laboratories to become commercial technologies that increasingly trigger the attention of States, military forces, banks, and private corporations. This work takes on the challenge of bringing QKD closer to a consumer technology: optical fibers deployed and used by telecommunication companies of different States have been used to realize a quantum network, the first-ever connecting three different countries. This pushes towards the necessary coexistence of QKD and classical communications on the same infrastructure, which currently represents a main limit of this technology. Our network connects Trieste to Rijeka and Ljubljana via a trusted node in Postojna; a key rate of over 3 kbps has been achieved in the shortest link, and a 7-hour long measurement has demonstrated the system stability and reliability. Finally, the network has been used for a public demonstration of QKD at the G20 Digital Ministers' Meeting in Trieste. The reported experimental results, together with the significant interest that one of the most important events of international politics has attracted, showcase the maturity of the QKD technology bundle, placing it in the spotlight for consumer applications in the near term.

quant-ph↗