arXiv subjects

Beatriz Dias

Publications and source records attributed to Beatriz Dias.

7 recordsLinked to original sources

arXiv2026

Optimal and improved gate decompositions for accelerated classical simulation of near-Gaussian fermionic circuits

Fermionic Gaussian circuits can be simulated efficiently on a classical computer, but become universal when supplemented with non-Gaussian operations. Similar to stabilizer circuits augmented with non-stabilizer resources, these non-Gaussian circuits can be simulated classically using rank- or extent-based methods. These methods decompose non-Gaussian states or operations into Gaussian ones, with runtimes that scale polynomially with measures of non-Gaussianity such as the rank and the extent -- quantities that typically grow exponentially with the number of non-Gaussian resources. Current fermionic rank- and extent-based simulators are limited to Gaussian circuits with magic-state injection. Extending them to mixed states and non-unitary channels has been hindered by the lack of known extent-optimized decompositions for physically relevant gates and noisy channels. In this work, we address this gap. First, we derive analytic decompositions for key non-Gaussian gates and channels, including decompositions for arbitrary two-qubit fermionic gates which are provably optimal for diagonal gates or those acting on Jordan-Wigner-adjacent qubit pairs. Second, we show that stochastic Pauli noise can reduce the effective extent of non-Gaussian rotation gates, but that fermionic magic is substantially more robust to such noise than stabilizer magic. Finally, we demonstrate how these decompositions can accelerate classical sampling from the output distribution of a quantum circuit. This involves a generalization of existing sparsification methods, previously limited to convex-unitary channels, to circuits involving intermediate measurements and feed-forward. Our decompositions also yield speedups for emulating noisy Pauli rotations with quasiprobability simulators in the large-angle/arbitrary-strength-noise and small-angle/low-noise parameter regimes.

quant-ph↗

arXiv2025

Composable logical gate error in approximate quantum error correction: reexamining gate implementations in Gottesman-Kitaev-Preskill codes

Quantifying the accuracy of logical gates is paramount in approximate error correction, where perfect implementations are often unachievable with the available set of physical operations. To this end, we introduce a single scalar quantity we call the (composable) logical gate error. It captures both the deviation of the logical action from the desired target gate as well as leakage out of the code space. It is subadditive under successive application of gates, providing a simple means for analyzing circuits. We show how to bound the composable logical gate error in terms of matrix elements of physical unitaries between (approximate) logical computational basis states. In the continuous-variable context, this sidesteps the need for computing energy-bounded norms. As an example, we study the composable logical gate error for linear optics implementations of Paulis and Cliffords in approximate Gottesman-Kitaev-Preskill (GKP) codes. We find that the logical gate error for implementations of Paulis depends linearly on the squeezing parameter. This implies that their accuracy improves monotonically with the amount of squeezing. For some Cliffords, however, linear optics implementations which are exact for ideal GKP codes fail in the approximate case: they have a constant logical gate error even in the limit of infinite squeezing. This is consistent with previous results about the limitations of certain gate implementations for approximate GKP codes. It shows that findings applicable to ideal GKP codes do not always translate to the realm of physically realizable approximate GKP codes.

quant-ph↗

arXiv2025

Classical simulation of non-Gaussian bosonic circuits

We propose efficient classical algorithms which (strongly) simulate the action of bosonic linear optics circuits applied to superpositions of Gaussian states. Our approach relies on an augmented covariance matrix formalism to keep track of relative phases between individual terms in a linear combination. This yields an exact simulation algorithm whose runtime is polynomial in the number of modes and the size of the circuit, and quadratic in the number of terms in the superposition. We also present a faster approximate randomized algorithm whose runtime is linear in this number. Our main building blocks are a formula for the triple overlap of three Gaussian states and a fast algorithm for estimating the norm of a superposition of Gaussian states up to a multiplicative error. Our construction borrows from earlier work on simulating quantum circuits in finite-dimensional settings, including, in particular, fermionic linear optics with non-Gaussian initial states and Clifford computations with non-stabilizer initial states. It provides algorithmic access to a practically relevant family of non-Gaussian bosonic circuits.

quant-ph↗

arXiv2025

Trading modes against energy

We ask how much energy is required to weakly simulate an $n$-qubit quantum circuit (i.e., produce samples from its output distribution) by a unitary circuit in a hybrid qubit-oscillator model. The latter consists of a certain number of bosonic modes coupled to a constant number of qubits by a Jaynes-Cummings Hamiltonian. We find that efficient approximate weak simulation of an $n$-qubit quantum circuit of polynomial size with inverse polynomial error is possible with (1) a linear number of bosonic modes and a polynomial amount of energy, or (2) a sublinear (polynomial) number of modes and a subexponential amount of energy, or (3) a constant number of modes and an exponential amount of energy. Our construction encodes qubits into high-dimensional approximate Gottesman-Kitaev-Preskill (GKP) codes. It provides new insight into the trade-off between system size (i.e., number of modes) and the amount of energy required to perform quantum computation in the continuous-variable setting.

quant-ph↗

arXiv2025

Qubit-oscillator-based gate implementations for approximate Gottesman-Kitaev-Preskill codes

We consider hybrid qubit-oscillator systems together with Gaussian, multi-qubit as well as qubit-controlled Gaussian unitaries. We propose implementations of logical gates for approximate Gottesman-Kitaev-Preskill codes in this model using two oscillators and three qubits. We show that these gate implementations become exact in the limit of large squeezing: The logical gate error is upper bounded by a linear function of the squeezing parameter, and depends polynomially on the number of encoded qubits. For certain Cliffords, our constructions overcome a shortcoming of well-known Gaussian implementations which have a constant logical gate error even in the absence of noise.

quant-ph↗

arXiv2025

On the sampling complexity of coherent superpositions

We consider the problem of sampling from the distribution of measurement outcomes when applying a POVM to a superposition $|Ψ\rangle = \sum_{j=0}^{χ-1} c_j |ψ_j\rangle$ of $χ$ pure states. We relate this problem to that of drawing samples from the outcome distribution when measuring a single state $|ψ_j\rangle$ in the superposition. Here $j$ is drawn from the distribution $p(j)=|c_j|^2/\|c\|^2_2$ of normalized amplitudes. We give an algorithm which $-$ given $O(χ\|c\|_2^2 \log1/δ)$ such samples and calls to oracles evaluating the involved probability density functions $-$ outputs a sample from the target distribution except with probability at most $δ$. In many cases of interest, the POVM and individual states in the superposition have efficient classical descriptions allowing to evaluate matrix elements of POVM elements and to draw samples from outcome distributions. In such a scenario, our algorithm gives a reduction from strong classical simulation (i.e., the problem of computing outcome probabilities) to weak simulation (i.e., the problem of sampling). In contrast to prior work focusing on finite-outcome POVMs, this reduction also applies to continuous-outcome POVMs. An example is homodyne or heterodyne measurements applied to a superposition of Gaussian states. Here we obtain a sampling algorithm with time complexity $O(N^3 χ^3 \|c\|_2^2 \log1/δ)$ for a state of $N$ bosonic modes.

quant-ph↗

arXiv2024

Classical simulation of non-Gaussian fermionic circuits

We propose efficient algorithms for classically simulating fermionic linear optics operations applied to non-Gaussian initial states. By gadget constructions, this provides algorithms for fermionic linear optics with non-Gaussian operations. We argue that this problem is analogous to that of simulating Clifford circuits with non-stabilizer initial states: Algorithms for the latter problem immediately translate to the fermionic setting. Our construction is based on an extension of the covariance matrix formalism which permits to efficiently track relative phases in superpositions of Gaussian states. It yields simulation algorithms with polynomial complexity in the number of fermions, the desired accuracy, and certain quantities capturing the degree of non-Gaussianity of the initial state. We study one such quantity, the fermionic Gaussian extent, and show that it is multiplicative on tensor products when the so-called fermionic Gaussian fidelity is. We establish this property for the tensor product of two arbitrary pure states of four fermions with positive parity.

quant-ph↗