arXiv subjects

Michele Vischi

Publications and source records attributed to Michele Vischi.

6 recordsLinked to original sources

arXiv2025

Mitigating Coherent Errors through a Decoherence-Resistant Variational Framework employing Stabilizer State

Stabilizer states are a central resource in quantum information processing, underpinning a wide range of applications. While they can be efficiently generated via Clifford circuits, the presence of coherent errors, such as small-angle miscalibrations in native gate implementations, can significantly impact their quality. In this work, we introduce Variational Coherent Error Mitigation (VCEM), a method that employs the stabilizer formalism to suppress coherent errors through variational optimization of native gates parameters. VCEM demonstrates robust performance, remaining largely unaffected by incoherent noise, enabling pre-compensation of coherent errors prior to the application of standard incoherent error mitigation techniques. We demonstrate the effectiveness and robustness of VCEM through numerical simulations.

quant-ph↗

arXiv2024

Equivariant Variational Quantum Eigensolver to detect Phase Transitions through Energy Level Crossings

Level spectroscopy stands as a powerful method for identifying the transition point that delineates distinct quantum phases. Since each quantum phase exhibits a characteristic sequence of excited states, the crossing of energy levels between low-lying excited states offers a reliable mean to estimate the phase transition point. While approaches like the Variational Quantum Eigensolver are useful for approximating ground states of interacting systems using quantum computing, capturing low-energy excitations remains challenging. In our study, we introduce an equivariant quantum circuit that preserves the total spin and the translational symmetry to accurately describe singlet and triplet excited states in the $J_1$-$J_2$ Heisenberg model on a chain, which are crucial for characterizing its transition point. Additionally, we assess the impact of noise on the variational state, showing that conventional mitigation techniques like Zero Noise Extrapolation reliably restore its physical properties.

quant-ph↗

arXiv2023

Simulating photonic devices with noisy optical elements

Quantum computers are inherently affected by noise. While in the long-term error correction codes will account for noise at the cost of increasing physical qubits, in the near-term the performance of any quantum algorithm should be tested and simulated in the presence of noise. As noise acts on the hardware, the classical simulation of a quantum algorithm should not be agnostic on the platform used for the computation. In this work, we apply the recently proposed noisy gates approach to efficiently simulate noisy optical circuits described in the dual rail framework. The evolution of the state vector is simulated directly, without requiring the mapping to the density matrix framework. Notably, we test the method on both the gate-based and measurement-based quantum computing models, showing that the approach is very versatile. We also evaluate the performance of a photonic variational quantum algorithm to solve the MAX-2-CUT problem. In particular we design and simulate an ansatz which is resilient to photon losses up to $p \sim 10^{-3}$ making it relevant for near term applications.

quant-ph↗

arXiv2023

Efficient quantum algorithm to simulate open systems through a single environmental qubit

We present an efficient algorithm for simulating open quantum systems dynamics described by the Lindblad master equation on quantum computers, addressing key challenges in the field. In contrast to existing approaches, our method achieves two significant advancements. First, we employ a repetition of unitary gates on a set of $n$ system qubits and, remarkably, only a single ancillary bath qubit representing the environment. It follows that, for the typical case of $m$-locality of the Lindblad operators, we reach an exponential improvement of the number of ancilla in terms of $m$ and up to a polynomial improvement in ancilla overhead for large $n$ with respect to other approaches. Although stochasticity is introduced, requiring multiple circuit realizations, the sampling overhead is independent of the system size. Secondly, we show that, under fixed accuracy conditions, our algorithm enables a reduction in the number of trotter steps compared to other approaches, substantially decreasing circuit depth. These advancements hold particular significance for near-term quantum computers, where minimizing both width and depth is critical due to inherent noise in their dynamics.

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

Fundamental limits of superconducting quantum computers

The Continuous Spontaneous Localization (CSL) model is an alternative formulation of quantum mechanics which introduces a noise coupled non linearly to the wave function to account for its collapse. We consider CSL effects on quantum computers made of superconducting transmon qubits. As a direct effect CSL reduces quantum superpositions of the computational basis states of the qubits: we show the reduction rate to be negligibly small. However, an indirect effect of CSL, dissipation induced by the noise, also leads transmon qubits to decohere, by generating additional quasiparticles. Since the decoherence rate of transmon qubits depends on the quasiparticle density, by computing their generation rate induced by CSL, we can estimate the corresponding quasiparticle density and thus the limit set by CSL on the performances of transmon quantum computers. We show that CSL could spoil the quantum computation of practical algorithms on large devices. We further explore the possibility of testing CSL effects on superconducting devices.

quant-ph↗