Search

Data show that the presence of women in quantum science is affected by a number of detriments and their percentage decreases even further for higher positions. Beyond data, from our shared personal experiences as female tenured quantum physics professors, we believe that the current model of scientific leadership, funding, and authority fails to represent many of us. It is time for a real change that calls for a different kind of force and for the participation of everyone. Women for quantum calls for a joint effort and aims with this initiative to contribute to such a transformation.

Error mitigation has elevated quantum computing to the scale of hundreds of qubits and tens of layers; however, yet larger scales (deeper circuits) are needed to fully exploit the potential of quantum computing to solve practical problems otherwise intractable. Here we demonstrate three key results that pave the way for the leap from quantum utility to quantum advantage: (1) we present a thorough derivation of random and systematic errors associated to the most advanced error mitigation strategies, including probabilistic error cancellation (PEC), zero noise extrapolation (ZNE) with probabilistic error amplification, and tensor-network error mitigation (TEM); (2) we prove that TEM (i) has the lowest sampling overhead among all three techniques under realistic noise, (ii) is optimal, in the sense that it saturates the universal lower cost bound for error mitigation, and (iii) is therefore the most promising approach to quantum advantage; (3) we propose a concrete notion of practical quantum advantage in terms of the universality of algorithms, stemming from the commercial need for a problem-independent quantum simulation device. We also establish a connection between error mitigation, relying on additional measurements, and error correction, relying on additional qubits, by demonstrating that TEM with a sufficient bond dimension works similarly to an error correcting code of distance 3. We foresee that the interplay and trade-off between the two resources will be the key to a smooth transition between error mitigation and error correction, and hence between near-term and fault-tolerant quantum computers. Meanwhile, we argue that quantum computing with optimal error mitigation, relying on modest classical computer power for tensor network contraction, has the potential to reach larger scales in accurate simulation than classical methods alone., Comment: 36 pages, 14 figures

The goal in quantum state transfer is to avoid the need to physically transport carriers of quantum information. This is achieved by using a suitably engineered Hamiltonian that induces the transfer of the state of one subsystem to another. A less known generalization of state transfer considers multiple systems such that any pair can exchange quantum information and transfers can take place at any time, starting and stopping independently. This is sometimes called routing of quantum states. State transfer in particular has received a great deal of attention, however the vast majority of results in both state transfer and routing concern qubits transferred in a network of restricted structure. Here we consider routing of single-mode Gaussian states and entanglement through complex networks of quantum harmonic oscillators. We compare a protocol where the transfer is completed in a single step but the effective Hamiltonian only approximately transfers the state with one where the transfer can in principle be perfect but the transfer is done in two steps, and also illustrate the state-dependency of the transfer fidelity. We find that even in a random and homogeneous network, the transfer fidelity still depends on the degree of the nodes for any link density, and that in both random and complex networks it is the community structure that controls the appearance of higher frequency normal modes useful for transfer. Finally, we find that networks of sufficient complexity may have superior routing performance over superficially similar random networks. Our results pave the way for further exploration of the role of community structure in state transfer and related tasks., Comment: 13 pages, 15 figures

Disease gene prioritization assigns scores to genes or proteins according to their likely relevance for a given disease based on a provided set of seed genes. Here, we describe a new algorithm for disease gene prioritization based on continuous-time quantum walks using the adjacency matrix of a protein-protein interaction (PPI) network. Our algorithm can be seen as a quantum version of a previous method known as the diffusion kernel, but, importantly, has higher performance in predicting disease genes, and also permits the encoding of seed node self-loops into the underlying Hamiltonian, which offers yet another boost in performance. We demonstrate the success of our proposed method by comparing it to several well-known gene prioritization methods on three disease sets, across seven different PPI networks. In order to compare these methods, we use cross-validation and examine the mean reciprocal ranks and recall values. We further validate our method by performing an enrichment analysis of the predicted genes for coronary artery disease. We also investigate the impact of adding self-loops to the seeds, and argue that they allow the quantum walker to remain more local to low-degree seed nodes., Comment: 12 pages, 9 figures

In recent years, there has been tremendous progress in the development of quantum computing hardware, algorithms and services leading to the expectation that in the near future quantum computers will be capable of performing simulations for natural science applications, operations research, and machine learning at scales mostly inaccessible to classical computers. Whereas the impact of quantum computing has already started to be recognized in fields such as cryptanalysis, natural science simulations, and optimization among others, very little is known about the full potential of quantum computing simulations and machine learning in the realm of healthcare and life science (HCLS). Herein, we discuss the transformational changes we expect from the use of quantum computation for HCLS research, more specifically in the field of cell-centric therapeutics. Moreover, we identify and elaborate open problems in cell engineering, tissue modeling, perturbation modeling, and bio-topology while discussing candidate quantum algorithms for research on these topics and their potential advantages over classical computational approaches., Comment: 6 figures

Multipacting (MP) is a phenomenon which can affect stability in particle accelerators and limit performance in superconducting radio frequency cavities. In the TESLA shaped, 1.3 GHz, 9-cell cavities used in the LCLS-II (L2) and LCLS-II-HE (HE) projects, the MP-band (~17-24 MV/m) lies within the required accelerating gradients. For HE, the operating gradient of 20.8 MV/m lies well within the MP-band and cryomodule testing has confirmed that this is an issue. As such, MP processing for the HE cryomodule test program will be discussed. Early results on MP processing in cryomodules installed in the L2 linac will also be presented, demonstrating that the methods used in cryomodule acceptance testing are also successful at conditioning MP in the accelerator and that this processing is preserved in the mid-term., Comment: 21st Intl Conf Radio Frequency Superconductivity (SRF 2023)

We discuss the long-time relaxation of a qubit linearly coupled to a finite bath of $N$ spins (two-level systems, TLSs), with the interaction Hamiltonian in rotating wave approximation. We focus on the regime $N\gg 1$, assuming that the qubit-bath coupling is weak, that the range of spin frequencies is sufficiently broad, and that all the spins are initialized in the ground state. Despite the model being perfectly integrable, we make two interesting observations about the effective system relaxation. First, as one would expect, the qubit relaxes exponentially towards its zero-temperature state at a well characterized rate. Second, the bath spins, even when mutually coupled, do not relax towards a thermal distribution, but rather form a Lorentzian distribution peaked at the frequency of the initially excited qubit. This behavior is captured by an analytical approximation that makes use of the property $N\gg 1$ to treat the TLS frequencies as a continuum and is confirmed by our numerical simulations., Comment: Invited contribution to the Lindblad memorial volume, to be published in Open Systems and Information Dynamics

The preparation of an equilibrium thermal state of a quantum many-body system on noisy intermediate-scale quantum (NISQ) devices is an important task in order to extend the range of applications of quantum computation. Faithful Gibbs state preparation would pave the way to investigate protocols such as thermalization and out-of-equilibrium thermodynamics, as well as providing useful resources for quantum algorithms, where sampling from Gibbs states constitutes a key subroutine. We propose a variational quantum algorithm (VQA) to prepare Gibbs states of a quantum many-body system. The novelty of our VQA consists in implementing a parameterized quantum circuit acting on two distinct, yet connected (via CNOT gates), quantum registers. The VQA evaluates the Helmholtz free energy, where the von Neumann entropy is obtained via post-processing of computational basis measurements on one register, while the Gibbs state is prepared on the other register, via a unitary rotation in the energy basis. Finally, we benchmark our VQA by preparing Gibbs states of the transverse field Ising and Heisenberg XXZ models and achieve remarkably high fidelities across a broad range of temperatures in statevector simulations. We also assess the performance of the VQA on IBM quantum computers, showcasing its feasibility on current NISQ devices., Comment: 15 pages, 13 figures

No quantum system can be considered totally isolated from its environment. In most cases the interaction between the system of interest and the external degrees of freedom deeply changes its dynamics, as described by open quantum system theory. Nevertheless, engineered environment can be turned into beneficial effects for some quantum information tasks. Here we demonstrate an optical simulator of a quantum system coupled to an arbitrary and reconfigurable environment built as a complex network of quantum interacting systems. We experimentally retrieve typical features of open quantum system dynamics like the spectral density and quantum non-Markovianity, by exploiting squeezing and entanglement correlation of a continuous variables optical platform. This opens the way to the experimental tests of open quantum systems in reconfigurable environments that are relevant in, among others, quantum information, quantum thermodynamics, quantum transport and quantum synchronization., Comment: 15 pages, 7 figures

Combining chemical vapor deposition (CVD) with electrochemical polish (EP) operations is a promising route to producing performance-capable superconducting films for use in the fabrication of cost-effective components for superconducting radiofrequency (SRF) particle accelerators and superconducting quantum computers. The post-deposition EP process enables a critically necessary reduction in surface roughness of niobium thin films to promote optimal superconducting surface conditions. In this work, surface morphology, roughness, and crystal orientation of the CVD-grown and EP-polished niobium films were investigated. The grain growth and polishing mechanisms were analyzed. The CVD films were found to comprise steps, kinks, and pyramidal features, resulting in undesirable large peak-to-valley distances. The electrochemical polish was demonstrated to significantly diminish the height of pyramids and effectively minimize the overall surface roughness. In contrast to buffered chemical polishing (BCP), EP results showed a probable dependence on crystal orientation, suggesting this process was influenced by locally enhanced current density and thickness variations of oxide dielectrics. These understandings identify the EP principles tied to CVD-grown Nb films that allow further refinement of surface profiles for film-based SRF applications

We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Tailored Ansatz Variational Quantum Eigensolver (ADAPT-VQE) framework for efficient quantum simulations of chemical systems on near-term quantum computers. To this end, our ADAPT-VQE-SCF approach combines the idea of generating an ansatz with a small number of parameters, resulting in shallow-depth quantum circuits with a direct minimization of an energy expression which is correct to second order with respect to changes in the molecular orbital basis. Our numerical analysis, including calculations for the transition metal complex ferrocene (Fe$\rm (C_5H_5)_2$), indicates that convergence in the self-consistent orbital optimization loop can be reached without a considerable increase in the number of two-qubit gates in the quantum circuit by comparison to a VQE optimization in the initial molecular orbital basis. Moreover, the orbital optimization can be carried out simultaneously within each iteration of the ADAPT-VQE cycle. ADAPT-VQE-SCF thus allows us to implement a routine analogous to CASSCF, a cornerstone of state-of-the-art computational chemistry, in a hardware-efficient manner on near-term quantum computers. Hence, ADAPT-VQE-SCF paves the way towards a paradigm shift for quantitative quantum-chemistry simulations on quantum computers by requiring fewer qubits and opening up for the use of large and flexible atomic orbital basis sets in contrast to earlier methods that are predominantly based on the idea of full active spaces with minimal basis sets., Comment: 21 pages, 5 figures

Quantum processing units boost entanglement at the level of hardware and enable physical simulations of highly correlated electron states in molecules and intermolecular chemical bonds. The variational quantum eigensolver provides a hardware-efficient toolbox for ground state simulation; however, with limitations in precision. Even in the absence of noise, the algorithm may result into a biased energy estimation, particularly with some shallower ansatz types. Noise additionally degrades entanglement and hinders the ground state energy estimation (especially if the noise is not fully characterized). Here we develop a method to exploit the quantum-classical interface provided by informationally complete measurements to use classical software on top of the hardware entanglement booster for ansatz- and noise-related error reduction. We use the tensor network representation of a quantum channel that drives the noisy state toward the ground one. The tensor network is a completely positive map by construction, but we elaborate on making the trace preservation condition local so as to activate the sweeping variational optimization. This method brings into reach energies below the noiseless ansatz by creating additional correlations among the qubits and denoising them. Analyzing the example of the stretched water molecule with a tangible entanglement, we argue that a hybrid strategy of using the quantum hardware together with the classical software outperforms a purely classical strategy provided the classical parts have the same bond dimension. The proposed optimization algorithm extends the variety of noise mitigation methods and facilitates the more accurate study of the energy landscape for deformed molecules. The algorithm can be applied as the final postprocessing step in the quantum hardware simulation of protein-ligand complexes in the context of drug design., Comment: 11 pages, 7 figures

Fermion-to-qubit mappings are used to represent fermionic modes on quantum computers, an essential first step in many quantum algorithms for electronic structure calculations. In this work, we present a formalism to design flexible fermion-to-qubit mappings from ternary trees. We discuss in an intuitive manner the connection between the generating trees' structure and certain properties of the resulting mapping, such as Pauli weight and the delocalisation of mode occupation. Moreover, we introduce a recipe that guarantees Fock basis states are mapped to computational basis states in qubit space, a desirable property for many applications in quantum computing. Based on this formalism, we introduce the Bonsai algorithm, which takes as input the potentially limited topology of the qubit connectivity of a quantum device and returns a tailored fermion-to-qubit mapping that reduces the SWAP overhead with respect to other paradigmatic mappings. We illustrate the algorithm by producing mappings for the heavy-hexagon topology widely used in IBM quantum computers. The resulting mappings have a favourable Pauli weight scaling $\mathcal{O}(\sqrt{N})$ on this connectivity, while ensuring that no SWAP gates are necessary for single excitation operations.

ADAPT-VQE stands out as a robust algorithm for constructing compact ans\"atze for molecular simulation. It enables to significantly reduce the circuit depth with respect to other methods, such as UCCSD, while achieving higher accuracy and not suffering from so-called barren plateaus that hinder the variational optimisation of many hardware-efficient ans\"atze. In its standard implementation, however, it introduces a considerable measurement overhead in the form of gradient evaluations trough estimations of many commutator operators. In this work, we mitigate this measurement overhead by exploiting a recently introduced method for energy evaluation relying on Adaptive Informationally complete generalised Measurements (AIM). Besides offering an efficient way to measure the energy itself, Informationally Complete (IC) measurement data can be reused to estimate all the commutators of the operators in the operator pool of ADAPT-VQE, using only classically efficient post-processing. We present the AIM-ADAPT-VQE scheme in detail, and investigate its performance with several H4 Hamiltonians and operator pools. Our numerical simulations indicate that the measurement data obtained to evaluate the energy can be reused to implement ADAPT-VQE with no additional measurement overhead for the systems considered here. In addition, we show that, if the energy is measured within chemical precision, the CNOT count in the resulting circuits is close to the ideal one. With scarce measurement data, AIM-ADAPT-VQE still converges to the ground state with high probability, albeit with an increased circuit depth in some cases.

The description of complex human mobility patterns is at the core of many important applications ranging from urbanism and transportation to epidemics containment. Data about collective human movements, once scarce, has become widely available thanks to new sources such as Phone CDR, GPS devices, or Smartphone apps. Nevertheless, it is still common to rely on a single dataset by implicitly assuming that it is a valid instance of universal dynamics, regardless of factors such as data gathering and processing techniques. Here, we test such an overarching assumption on an unprecedented scale by comparing human mobility datasets obtained from 7 different data-sources, tracing over 500 millions individuals in 145 countries. We report wide quantifiable differences in the resulting mobility networks and, in particular, in the displacement distribution previously thought to be universal. These variations -- that do not necessarily imply that the human mobility is not universal -- also impact processes taking place on these networks, as we show for the specific case of epidemic spreading. Our results point to the crucial need for disclosing the data processing and, overall, to follow good practices to ensure the robustness and the reproducibility of the results.

The Born rule describes the probability of obtaining an outcome when measuring an observable of a quantum system. As it can only be tested by measuring many copies of the system under consideration, it does not hold for non-replicable systems. For these systems, we give a procedure to predict the future statistics of measurement outcomes through Repeated Measurements (RM). This is done by extending the validity of quantum mechanics to those systems admitting no replicas; we prove that if the statistics of the results acquired by performing RM on such systems is sufficiently similar to that obtained by the Born rule, the latter can be used effectively. We apply our framework to a repeatedly measured Unruh-DeWitt detector interacting with a massless scalar quantum field, which is an example of a system (detector) interacting with an uncontrollable environment (field) for which using RM is necessary. Analysing what an observer learns from the RM outcomes, we find a regime where history-dependent RM probabilities are close to the Born ones. Consequently, the latter can be used for all practical purposes. Finally, we numerically study inertial and accelerated detectors, showing that an observer can see the Unruh effect via RM., Comment: 31 pages, 9 figures; v2 includes new references; v3,v4 (accepted manuscript) includes some revisions

The quantum collision models are a useful method to describe the dynamics of an open quantum system by means of repeated interactions between the system and some particles of the environment, which are usually termed "ancillas". In this paper, we review the main collision models for the dynamics of multipartite open quantum systems, which are composed of several subsystems. In particular, we are interested in models that are based on elementary collisions between the subsystems and the ancillas, and that simulate global and/or local Markovian master equations in the limit of infinitesimal timestep. After discussing the mathematical details of the derivation of a generic collision-based master equation, we provide the general ideas at the basis of the collision models for multipartite systems, we discuss their strengths and limitations, and we show how they may be simulated on a quantum computer. Moreover, we analyze some properties of a collision model based on entangled ancillas, derive the master equation it generates for small timesteps, and prove that the coefficients of this master equation are subject to a constraint that limits their generality. Finally, we present an example of this collision model with two bosonic ancillas entangled in a two-mode squeezed thermal state., Comment: Accepted version in the special issue of Open Syst. Inf. Dyn. devoted to the memory of Prof. A. Kossakowski. We have added the current Appendix A, new references, and additional discussions on the cascade master equation

Protein-protein interaction (PPI) networks consist of the physical and/or functional interactions between the proteins of an organism. Since the biophysical and high-throughput methods used to form PPI networks are expensive, time-consuming, and often contain inaccuracies, the resulting networks are usually incomplete. In order to infer missing interactions in these networks, we propose a novel class of link prediction methods based on continuous-time classical and quantum random walks. In the case of quantum walks, we examine the usage of both the network adjacency and Laplacian matrices for controlling the walk dynamics. We define a score function based on the corresponding transition probabilities and perform tests on four real-world PPI datasets. Our results show that continuous-time classical random walks and quantum walks using the network adjacency matrix can successfully predict missing protein-protein interactions, with performance rivalling the state of the art., Comment: 9 pages, 5 figures

We present adaptive measurement techniques tailored for variational quantum algorithms on near-term small and noisy devices. In particular, we generalise earlier "learning to measure" strategies in two ways. First, by considering a class of adaptive positive operator valued measures (POVMs) that can be simulated with simple projective measurements without ancillary qubits, we decrease the amount of required qubits and two-qubit gates. Second, by introducing a method based on Quantum Detector Tomography to mitigate the effect of noise, we are able to optimise the POVMs as well as to infer expectation values reliably in the currently available noisy quantum devices. Our numerical simulations clearly indicate that the presented strategies can significantly reduce the number of needed shots to achieve chemical accuracy in variational quantum eigensolvers, thus helping to solve one of the bottlenecks of near-term quantum computing., Comment: 10+4 pages, 4 figures

In this paper, we have proposed STC-GEF, a novel Spatio-Temporal Cross-platform Graph Embedding Fusion approach for the urban traffic flow prediction. We have designed a spatial embedding module based on graph convolutional networks (GCN) to extract the complex spatial features within traffic flow data. Furthermore, to capture the temporal dependencies between the traffic flow data from various time intervals, we have designed a temporal embedding module based on recurrent neural networks. Based on the observations that different transportation platforms trip data (e.g., taxis, Uber, and Lyft) can be correlated, we have designed an effective fusion mechanism that combines the trip data from different transportation platforms and further uses them for cross-platform traffic flow prediction (e.g., integrating taxis and ride-sharing platforms for taxi traffic flow prediction). We have conducted extensive real-world experimental studies based on real-world trip data of yellow taxis and ride-sharing (Lyft) from the New York City (NYC), and validated the accuracy and effectiveness of STC-GEF in fusing different transportation platform data and predicting traffic flows., Comment: 5 pages, UrbComp 2022

The rapid progress in quantum computing witnessed in recent years has sparked widespread interest in developing scalable quantum information theoretic methods to work with large quantum systems. For instance, several approaches have been proposed to bypass tomographic state reconstruction, and yet retain to a certain extent the capability to estimate multiple physical properties of a given state previously measured. In this paper, we introduce the Virtual Linear Map Algorithm (VILMA), a new method that enables not only to estimate multiple operator averages using classical post-processing of informationally complete measurement outcomes, but also to do so for the image of the measured reference state under low-depth circuits of arbitrary, not necessarily physical, $k$-local maps. We also show that VILMA allows for the variational optimisation of the virtual circuit through sequences of efficient linear programs. Finally, we explore the purely classical version of the algorithm, in which the input state is a state with a classically efficient representation, and show that the method can prepare ground states of many-body Hamiltonians., Comment: 10 pages, 5 figs. Comments welcome

Scientific and technological advances in medicine and systems biology have unequivocally shown that health and disease must be viewed in the context of the interplay among multiple molecular and environmental factors. Understanding the effects of cellular interconnection on disease progression may lead to the identification of novel disease genes and pathways, and hence influence precision diagnostics and therapeutics. To accomplish this goal, the emerging field of network medicine applies network science approaches to investigate disease pathogenesis, integrating information from relevant Omics databases, including protein-protein interaction, correlation-based, gene regulatory, and Bayesian networks. However, this requires analysing and computing large amounts of data. Moreover, if we are to efficiently search for new drugs and new drug combinations, there is a pressing need for computational methods that could allow us to access the immense chemical compound space until now largely unexplored. Finally, at the microscopic level, drug-target chemistry simulation is ultimately a quantum problem, and hence it requires a quantum solution. As we will discuss, quantum computing may be a key ingredient in enabling the full potential of network medicine. We propose to combine network medicine and quantum algorithms in a novel research field, quantum network medicine, to lay the foundations of a new era of disease prevention and drug design.

We study spatial search with continuous-time quantum walks on real-world complex networks. We use smaller replicas of the Internet network obtained with a recent geometric renormalization method introduced by Garc\'ia-P\'erez et al., Nat. Phys. 14, 583 (2018). This allows us to infer for the first time the behavior of a quantum spatial search algorithm on a real-world complex network. By simulating numerically the dynamics and optimizing the coupling parameter, we study the optimality of the algorithm and its scaling with the size of the network, showing that on average it is considerably better than the classical scaling $\mathcal{O}(N)$, but it does not reach the ideal quadratic speedup $\mathcal{O}(\sqrt{N})$ that can be achieved, e.g. in complete graphs. However, the performance of the search algorithm strongly depends on the degree of the nodes and, in fact, the scaling is found to be very close to optimal when we consider the nodes below the $99$th percentile ordered according to the degree., Comment: 11 pages, 6 figures

Field emission (FE) is one of the main limiting factors of superconducting radio-frequency (SRF) cavities operating in accelerators and it occurs whenever contaminants, like dust, metal flakes or even absorbates, are present on the surface of the cavity high electric field region. Field emission reduces the maximum achievable accelerating field and generates free electrons that may interact with the beam, damage or activate the beamline. One practical method that can be used to mitigate this problem is in-situ plasma cleaning, or plasma processing. The development of a processing that can be applied in-situ is extremely advantageous, since it enables the recovery of the cryomodule performance without the need of disassembling the whole cryomodule, which is an extremely expensive and time-consuming process. On the other hand, plasma processing only requires the cryomodule warm-up to room-temperature and the subsequent processing of the contaminated cavities. The entire process is reasonably quick and involves a limited number of personnel. For these reasons we would like to advocate for continuing to invest in the R\&D of plasma processing to optimize its applicability in cryomodules and for extending the technique to other frequency ranges and cavities geometries., Comment: contribution to Snowmass 2021

In this article, we provide an extensive overview of a wide range of quantum games and interactive tools that have been employed by the community in recent years. The paper presents selected tools, as described by their developers. The list includes Hello Quantum, Hello Qiskit, Particle in a Box, Psi and Delta, QPlayLearn, Virtual Lab by Quantum Flytrap, Quantum Odyssey, ScienceAtHome, and The Virtual Quantum Optics Laboratory. Additionally, we present events for quantum game development: hackathons, game jams, and semester projects. Furthermore, we discuss the Quantum Technologies Education for Everyone (QUTE4E) pilot project, which illustrates an effective integration of these interactive tools with quantum outreach and education activities. Finally, we aim at providing guidelines for incorporating quantum games and interactive tools in pedagogic materials to make quantum technologies more accessible for a wider population., Comment: 39 pages, 17 figures

Dissipative collective effects are ubiquitous in quantum physics, and their relevance ranges from the study of entanglement in biological systems to noise mitigation in quantum computers. Here, we put forward the first fully quantum simulation of dissipative collective phenomena on a real quantum computer, based on the recently introduced multipartite collision model. First, we theoretically study the accuracy of this algorithm on near-term quantum computers with noisy gates, and we derive some rigorous error bounds that depend on the timestep of the collision model and on the gate errors. These bounds can be employed to estimate the necessary resources for the efficient quantum simulation of the collective dynamics. Then, we implement the algorithm on some IBM quantum computers to simulate superradiance and subradiance between a pair of qubits. Our experimental results successfully display the emergence of collective effects in the quantum simulation. In addition, we analyze the noise properties of the gates that we employ in the algorithm by means of full process tomography, with the aim of improving our understanding of the errors in the near-term devices that are currently accessible to worldwide researchers. We obtain the values of the average gate fidelity, unitarity, incoherence and diamond error, and we establish a connection between them and the accuracy of the experimentally simulated state. Moreover, we build a noise model based on the results of the process tomography for two-qubit gates and show that its performance is comparable with the noise model provided by IBM. Finally, we observe that the scaling of the error as a function of the number of gates is favorable, but at the same time reaching the threshold of the diamond errors for quantum fault tolerant computation may still be orders of magnitude away in the devices that we employ., Comment: Accepted version. We have extensively expanded and modified the experimental noise analysis