arXiv subjects

Alessandro Bisio

Publications and source records attributed to Alessandro Bisio.

At least 19 recordsLinked to original sources

arXiv2026

Universal free-space photonic circuits for polarized structured light

Traditional linear-optical schemes for implementing discrete unitary transformations rely on multi-channel interferometers, typically composed of regular meshes of beam splitters and phase shifters. These architectures are well-suited to integrated photonics, where scalability and miniaturization are central requirements. In free space, universal transformations of optical modes have often been pursued through propagation in structured or inverse-designed optical systems, offering advantages in terms of addressable optical modes, reconfigurability, and flexible detection schemes. Here, we present a complementary approach: a collinear free-space photonic circuit that implements the standard interferometric paradigm in a Hilbert space of polarized structured-light modes. The circuit exploits spin-orbit coupling between circular polarization and optical modes carrying quantized transverse momentum, so that conventional beam splitters and phase shifters are replaced by structured optical materials acting directly on selected spin-orbit modes. In our demonstration, liquid-crystal metasurfaces serve as mode beam splitters and phase shifters, and we experimentally realize representative gates in a four-mode space. We further show how the architecture generalizes to larger numbers of modes, providing a scalable route to arbitrary unitary transformations in free space. Numerical optimization over random target unitaries supports the universality of the proposed scheme. These results establish a framework for universal free-space photonic circuits encoded in structured light and structured matter.

physics.optics↗

arXiv2026

Higher-order transformations of bidirectional quantum processes

Bidirectional devices are devices for which the roles of the input and output ports can be exchanged. Mathematically, these devices are described by bistochastic quantum channels, namely completely positive linear maps that are both trace-preserving and identity-preserving. Recently, it has been shown that bidirectional quantum devices can, in principle, be used in ways that are incompatible with a definite input-output direction, giving rise to a new phenomenon called input-output indefiniteness. Here we characterize the most general forms of input-output indefiniteness, associated with a hierarchy of higher-order transformations built from transformations of bistochastic quantum channels. Some levels of the hierarchy correspond to transformations that combine bistochastic channels in a definite causal order, while generally using each channel in an indefinite input-output direction. For other levels of the hierarchy, the indefiniteness can involve both the local input-output direction of each process and the global causal order among the processes. On the foundational side, the hierarchy of higher-order transformations characterized here can be regarded as the largest set of physical processes compatible with a time-symmetric variant of quantum theory, where the possible state transformations are restricted to bistochastic channels.

quant-ph↗

arXiv2025

Renormalisation of Fermionic Cellular Automata

We present an exact renormalisation scheme for fermionic cellular automata on hypercubic lattices. By grouping neighbouring cells into tiles and selecting subspaces within them, multiple evolution steps on the original system correspond to a single step of an effective automaton acting on the subspaces. We derive a necessary and sufficient condition for renormalisability and fully characterise the renormalisation flow for two-cell tiles and two time steps of nearest-neighbour fermionic automata on a chain of spinless modes, identifying all fixed points.

quant-ph↗

arXiv2025

Fermionic cellular automata in one dimension

We consider quantum cellular automata for one-dimensional chains of Fermionic modes and study their implementability as finite depth quantum circuits. Fermionic automata have been classified in terms of an index modulo circuits and the addition of ancillary systems. We strengthen this result removing the ancilla degrees of freedom in defining the equivalence classes. A complete characterization of nearest-neighbours automata is given. A class of Fermionic automata is found which cannot be expressed in terms of single mode and controlled-phase gates composed with shifts, as is the case for qubit cellular automata.

quant-ph↗

arXiv2024

Effective dynamics from minimising dissipation

It is known that the same physical system can be described by different effective theories depending on the scale at which it is observed. In this work, we formulate a prescription for finding the unitary that best approximates the large scale dynamics of a quantum system evolving discretely in time, as it is the case for digital quantum simulators. We consider the situation in which the degrees of freedom of the system can be divided between an IR part that we can observe, and a UV part that we cannot observe. Following a principle of minimal dissipation, our goal is to find the unitary dynamics that best approximates the (generally non unitary) time evolution of the IR degrees of freedom. We first prove that when the IR and UV degrees of freedom are weakly coupled, the unitary that maximises the fidelity is given by a mean-field dynamics and the error is given by a sum of energy variances. We then apply our results to a one dimensional quantum walk, which is known to reproduce the Dirac equation in the small mass and momenta limit. We find that in this limit the effective IR dynamics is obtained by a mass redefinition.

quant-ph↗

arXiv2024

Storage and retrieval of two unknown unitary channels

We address the fundamental task of converting $n$ uses of an unknown unitary transformation into a quantum state (i.e., storage) and later retrieval of the transformation. Specifically, we consider the case where the unknown unitary is selected with equal prior probability from two options. First, we prove that the optimal storage strategy involves the sequential application of the $n$ uses of the unknown unitary, and it produces the optimal state for discrimination between the two possible unitaries. Next, we show that incoherent "measure-and-prepare" retrieval achieves the maximum fidelity between the retrieved operation and the original (qubit) unitary. We then identify the retrieval strategy that maximizes the probability of successfully and perfectly retrieving the unknown transformation. In the regime in which the fidelity between the two possible unitaries is large the probability of success scales as $ P_{succ} = 1 - \mathcal{O}(n^{-2} ) $, which is a quadratic improvement with respect to the case in which the unitaries are drawn from the entire unitary group $U(d)$ with uniform prior probability. Finally, we present an optical experiment for this approach and assess the storage and retrieval quality using quantum tomography of states and processes. The results are discussed in relation to non-optimal measure-and-prepare strategy, highlighting the advantages of our protocol.

quant-ph↗

arXiv2024

Classification of qubit cellular automata on hypercubic lattices

We classify quantum cellular automata whose cells are qubits, on hypercubic lattices $\mathbb Z^s$, with the von Neumann neighborhood scheme, in terms of realizability as finite-depth quantum circuits. We show the most general structure of such automata and use its characterisation to simulate a few steps of evolution and evaluate the rate of entanglement production between one cell and its surroundings.

quant-ph↗

arXiv2024

Renormalisation of Quantum Cellular Automata

We study a coarse-graining procedure for quantum cellular automata on hypercubic lattices that consists in grouping neighboring cells into tiles and selecting a subspace within each tile. This is done in such a way that multiple evolution steps applied to this subspace can be viewed as a single evolution step of a new quantum cellular automaton, whose cells are the subspaces themselves. We derive a necessary and sufficient condition for renormalizability and use it to investigate the renormalization flow of cellular automata on a line, where the cells are qubits and the tiles are composed of two neighboring cells. The problem is exhaustively solved, and the fixed points of the renormalization flow are highlighted.

quant-ph↗

arXiv2024

A perturbative approach to the solution of the Thirring quantum cellular automaton

The Thirring Quantum Cellular Automaton (QCA) describes the discrete time dynamics of local fermionic modes that evolve according to one step of the Dirac cellular automaton followed by the most general on-site number-preserving interaction, and serves as the QCA counterpart of the Thirring model in quantum field theory. In this work, we develop perturbative techniques for the QCA path-sum approach, expanding both the number of interaction vertices and the mass parameter of the Thirring QCA. By classifying paths within the regimes of very light and very heavy particles, we computed the transition matrices in the two- and three-particle sectors to the first few orders. Our investigation into the properties of the Thirring QCA, addressing the combinatorial complexity of the problem, yielded some useful results applicable to the many-particle sector of any on-site number-preserving interactions in one spatial dimension.

quant-ph↗

arXiv2024

Photonic cellular automaton simulation of relativistic quantum fields: observation of Zitterbewegung

Quantum Cellular Automaton (QCA) is a model for universal quantum computation and a natural candidate for digital quantum simulation of relativistic quantum fields. Here we introduce the first photonic platform for implementing QCA-simulation of a free relativistic Dirac quantum field in 1+1 dimension, through a Dirac Quantum Cellular Automaton (DQCA). Encoding the field position degree of freedom in the Orbital Angular Momentum (OAM) of single photons, our state-of-the-art setup experimentally realizes 8 steps of a DQCA, with the possibility of having complete control over the input OAM state preparation and the output measurement making use of two spatial light modulators. Therefore, studying the distribution in the OAM space at each step, we were able to reproduce the time evolution of the free Dirac field observing, the Zitterbewegung, an oscillatory movement extremely difficult to see in real case experimental scenario that is a signature of the interference of particle and antiparticle states. The accordance between the expected and measured Zitterbewegung oscillations certifies the simulator performances, paving the way towards the application of photonic platforms to the simulation of more complex relativistic effects.

quant-ph↗

arXiv2023

A massless interacting Fermionic Cellular Automaton exhibiting bound states

We present a Fermionic Cellular Automaton model which describes massless Dirac fermion in 1+1 dimension coupled with local, number preserving interaction. The diagonalization of the two particle sector shows that specific values of the total momentum and of the coupling constant allows for the formation of bound states. Furthermore, we present a classification of the local number-preserving interactions that are invariant under the isotropy group of the cellular automaton which simulates the Weyl equation.

quant-ph↗

arXiv2022

No-signalling constrains quantum computation with indefinite causal structure

Quantum processes with indefinite causal structure emerge when we wonder which are the most general evolutions, allowed by quantum theory, of a set of local systems which are not assumed to be in any particular causal order. These processes can be described within the framework of higher-order quantum theory which, starting from considering maps from quantum transformations to quantum transformations, recursively constructs a hierarchy of quantum maps of increasingly higher order. In this work, we develop a formalism for quantum computation with indefinite causal structures; namely, we characterize the computational structure of higher order quantum maps. Taking an axiomatic approach, the rules of this computation are identified as the most general compositions of higher order maps which are compatible with the mathematical structure of quantum theory. We provide a mathematical characterization of the admissible composition for arbitrary higher order quantum maps. We prove that these rules, which have a computational and information-theoretic nature, are determined by the more physical notion of the signalling relations between the quantum systems of the higher order quantum maps.

quant-ph↗

arXiv2021

Scattering and perturbation theory for discrete-time dynamics

We present a systematic treatment of scattering processes for quantum systems whose time evolution is discrete. We define and show some general properties of the scattering operator, in particular the conservation of quasi-energy which is defined only modulo $2 π$. Then we develop two perturbative techniques for the power series expansion of the scattering operator, the first one analogous to the iterative solution of the Lippmann-Schwinger equation, the second one to the Dyson series of perturbative Quantum Field Theory. We use this formalism to compare the scattering amplitudes of a continuous-time model and of the corresponding discretized one. We give a rigorous assessment of the comparison for the case of bounded free Hamiltonian, as in a lattice theory with a bounded number of particles. Our framework can be applied to a wide class of quantum simulators, like quantum walks and quantum cellular automata. As a case study, we analyse the scattering properties of a one-dimensional cellular automaton with locally interacting fermions.

quant-ph↗

arXiv2020

Data-Driven Inference, Reconstruction, and Observational Completeness of Quantum Devices

The range of a quantum measurement is the set of outcome probability distributions that can be produced by varying the input state. We introduce data-driven inference as a protocol that, given a set of experimental data as a collection of outcome distributions, infers the quantum measurement which is, i) consistent with the data, in the sense that its range contains all the distributions observed, and, ii) maximally noncommittal, in the sense that its range is of minimum volume in the space of outcome distributions. We show that data-driven inference is able to return a unique measurement for any data set if and only if the inference adopts a (hyper)-spherical state space (for example, the classical or the quantum bit). In analogy to informational completeness for quantum tomography, we define observational completeness as the property of any set of states that, when fed into any given measurement, produces a set of outcome distributions allowing for the correct reconstruction of the measurement via data-driven inference. We show that observational completeness is strictly stronger than informational completeness, in the sense that not all informationally complete sets are also observationally complete. Moreover, we show that for systems with a (hyper)-spherical state space, the only observationally complete simplex is the regular one, namely, the symmetric informationally complete set.

quant-ph↗

arXiv2019

Theoretical framework for Higher-Order Quantum Theory

Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes recursively, with the construction of a full hierarchy of maps of increasingly higher order. The analysis of special cases already showed that higher-order quantum functions exhibit features that cannot be tracked down to the usual circuits, such as indefinite causal structures, providing provable advantages over circuital maps. The present treatment provides a general framework where this kind of analysis can be carried out in full generality. The hierarchy of higher-order quantum maps is introduced axiomatically with a formulation based on the language of types of transformations. Complete positivity of higher-order maps is derived from the general admissibility conditions instead of being postulated as in previous approaches. The recursive characterization of convex sets of maps of a given type is used to prove equivalence relations between different types. The axioms of the framework do not refer to the specific mathematical structure of quantum theory, and can therefore be exported in the context of any operational probabilistic theory.

quant-ph↗

arXiv2019

Symmetries of the Dirac quantum walk and emergence of the de Sitter group

A quantum walk describes the discrete unitary evolution of a quantum particle on a discrete graph. Some quantum walks, referred to as the Weyl and Dirac quantum walks, provide a description of the free evolution of relativistic quantum fields in a regime where the wave-vectors involved in the particle state are small. The clash between the intrinsic discreteness of quantum walks and the symmetries of special relativity can be resolved by rethinking the notion of a change of inertial reference frame. We give here a definition of the latter that avoids a pre-defined space-time geometry, in terms of a change of values of the constants of motion that leaves the walk operator unchanged. Starting from the family of 1+1 dimensional Dirac quantum walks with all possible values of the mass parameter, we introduce a unique walk encompassing the latter as an extra degree of freedom, and we derive its group of changes of inertial frames. This symmetry group contains a non linear realization of $SO^+(2,1) \ltimes \mathbb{R}^3$; since one of the two space-like dimensions does not correspond to an actual spatial degree of freedom but rather the mass, we interpret it as a 2+1 dimensional de-Sitter group. This group group contains also a non-linear realisation of the proper orthochronous Poincaré group $SO^+(1,1) \ltimes \mathbb{R}^2$ in 1+1 dimension, as the ones considered within the framework of doubly special relativity, which recovers the usual relativistic symmetry of the Dirac Equation in the limit of small wave-vectors and masses. Surprisingly, if one considers the Dirac walk with a fixed value of the mass parameter, the group of allowed changes of reference frame does not have a consistent interpretation in the relativistic limit of small wave-vectors.

quant-ph↗

arXiv2018

Optimal probabilistic storage and retrieval of unitary channels

We address the question of a quantum memory storage of quantum dynamics. In particular, we design an optimal protocol for $N\to 1$ probabilistic storage-and-retrieval of unitary channels on $d$-dimensional quantum systems. If we may access the unknown unitary gate only $N$-times, the optimal success probability of perfect retrieval of its single use is $N/(N-1+d^2)$. The derived size of the memory system exponentially improves the known upper bound on the size of the program register needed for probabilistic programmable quantum processors. Our results are closely related to probabilistic perfect alignment of reference frames and probabilistic port-based teleportation.

quant-ph↗

arXiv2018

On some new hook-content identities

Based on the work of A. Vershik, we introduce two new combinatorial identities. We show how these identities can be used to prove a new hook-content identity. The main motivation for deriving this identity was a particular optimization problem in the field of quantum information processing.

math.CO↗