Search

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.

Photonic quantum computers, programmed within the framework of the measurement-based quantum computing (MBQC), currently concur with gate-based platforms in the race towards useful quantum advantage, and some algorithms emerged as main candidates to reach this goal in the near term. Yet, the majority of these algorithms are only expressed in the gate-based model of computation, which is incompatible with photonic platforms. Methods to translate gate-based algorithms into the MBQC framework exist, but they are not always optimal in terms of resource cost. In our work, we propose an MBQC algorithm to run the Quantum Approximate Optimization Algorithm (QAOA). Furthermore, we apply the MBQC-QAOA algorithm to the MAX $K$-CUT problem, working for all values of $K$, expressing the cost Hamiltonian and its constraints in a form easily implementable in the MBQC model. We conclude analyzing the resource-cost of our algorithm, compared to the case of translating a gate-based QAOA algorithm into MBQC rules showing up to a 30-fold improvement. With our work, we contribute to close the gap between gate-based and MBQC near-term algorithms, a gap not reflecting the current status of the hardware development., Comment: Published on PRA

In this work, we describe in detail how Deep Learning and Computer Vision can help to detect fault events of the AirTender system, an aftermarket motorcycle damping system component. One of the most effective ways to monitor the AirTender functioning is to look for oil stains on its surface. Starting from real-time images, AirTender is first detected in the motorbike suspension system, simulated indoor, and then, a binary classifier determines whether AirTender is spilling oil or not. The detection is made with the help of the Yolo5 architecture, whereas the classification is carried out with the help of a suitably designed Convolutional Neural Network, OilNet40. In order to detect oil leaks more clearly, we dilute the oil in AirTender with a fluorescent dye with an excitation wavelength peak of approximately 390 nm. AirTender is then illuminated with suitable UV LEDs. The whole system is an attempt to design a low-cost detection setup. An on-board device, such as a mini-computer, is placed near the suspension system and connected to a full hd camera framing AirTender. The on-board device, through our Neural Network algorithm, is then able to localize and classify AirTender as normally functioning (non-leak image) or anomaly (leak image)., Comment: analysis of literature reviewed, n.2 figures added, minor corrections

Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit, whereas up to N-1 entanglement pairs are consumed in the traditional pair-wise protocol. We demonstrate the advantage provided by GHZ states in a testbed consisting of a photonic six-user quantum network, where four users can distil either a GHZ state or the required number of Bell pairs for QCKA using network routing techniques. In the asymptotic limit, we report a more than two-fold enhancement of the conference key rate when comparing the two protocols. We extrapolate our data set to show that the resource advantage for the GHZ protocol persists when taking into account finite-key effects.

Quantum annealing has emerged in the last few years as a promising quantum computing approach to solving large-scale combinatorial optimization problems. In this paper, we formulate the problem of correctly placing pressure sensors on a Water Distribution Network (WDN) as a combinatorial optimization problem in the form of a Quadratic Unconstrained Binary Optimization (QUBO) or Ising model. Optimal sensor placement is indeed key to detect and isolate fault events. We outline the QUBO and Ising formulations for the sensor placement problem starting from the network topology and few other features. We present a detailed procedure to solve the problem by minimizing its Hamiltonian using PyQUBO, an open-source Python Library. We then apply our methods to the case of a real Water Distribution Network. Both simulated annealing and a hybrid quantum-classical approach on a D-Wave machine are employed., Comment: 10 pages, 3 figures. v2: minor corrections

In this paper, we present an approach to evaluate Research \& Development (R\&D) performance based on the Analytic Hierarchy Process (AHP) method. Through a set of questionnaires submitted to a team of experts, we single out a set of indicators needed for R\&D performance evaluation. The indicators, together with the corresponding criteria, form the basic hierarchical structure of the AHP method. The numerical values associated with all the indicators are then used to assign a score to a given R\&D project. In order to aggregate consistently the values taken on by the different indicators, we operate on them so that they are mapped to dimensionless quantities lying in a unit interval. This is achieved by employing the empirical Cumulative Density Function (CDF) for each of the indicators. We give a thorough discussion on how to assign a score to an R\&D project along with the corresponding uncertainty due to possible inconsistencies of the decision process. A particular example of R\&D performance is finally considered., Comment: 13 pages, 2 figures

Setting sale prices correctly is of great importance for firms, and the study and forecast of prices time series is therefore a relevant topic not only from a data science perspective but also from an economic and applicative one. In this paper we examine different techniques to forecast sale prices applied by an Italian food wholesaler, as a step towards the automation of pricing tasks usually taken care by human workforce. We consider ARIMA models and compare them to Prophet, a scalable forecasting tool by Facebook based on a generalized additive model, and to deep learning models exploiting Long Short--Term Memory (LSTM) and Convolutional Neural Networks (CNNs). ARIMA models are frequently used in econometric analyses, providing a good benchmark for the problem under study. Our results indicate that ARIMA models and LSTM neural networks perform similarly for the forecasting task under consideration, while the combination of CNNs and LSTMs attains the best overall accuracy, but requires more time to be tuned. On the contrary, Prophet is quick and easy to use, but considerably less accurate.t overall accuracy, but requires more time to be tuned. On the contrary, Prophet is quick and easy to use, but considerably less accurate., Comment: 17 pages, 9 figures, 10 tables. v3: improved structure and content, added figures and references

Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks such as parallel computation and circuit optimisation. Crucially, the communication overhead introduced by the allotment process should be minimised -- a key motivation behind the communication complexity problem (CCP). Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. Furthermore, the connection between quantum CCPs and nonlocality provides an information-theoretic insights into fundamental quantum mechanics. Here we connect quantum CCPs with a generalised nonlocality framework -- beyond the paradigmatic Bell's theorem -- by incorporating the underlying causal structure, which governs the distributed task, into a so-called nonlocal hidden variable model. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities, whose violation is both necessary and sufficient for a quantum gain. We experimentally implement a multipartite CCP akin to the guess-your-neighbour-input scenario, and demonstrate a quantum advantage when multipartite Greenberger-Horne-Zeilinger (GHZ) states are shared among three users., Comment: 21 pages, 5 figures

Entanglement in high-dimensional quantum systems, where one or more degrees of freedom of light are involved, offers increased information capacities and enables new quantum protocols. Here, we demonstrate a functional source of high-dimensional, noise-resilient hyperentangled states encoded in time-frequency and vector-vortex structured modes, which in turn carry single-particle entanglement between polarisation and orbital angular momentum. Pairing nonlinearity-engineered parametric downconversion in an interferometric scheme with spin-to-orbital-angular-momentum conversion, we generate highly entangled photon pairs at telecom wavelength that we characterise via two-photon interference and quantum state tomography, achieving near-unity visibilities and fidelities. While hyperentanglement has been demonstrated before in photonic qubits, this is the first instance of such a rich entanglement structure involving spectrally and spatially structured light, where three different forms of entanglement coexist in the same biphoton state., Comment: 5 pages, 4 figures, Supplement: 6 pages, 2 figures

Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale. Traditional quantum communication protocols consume pair-wise entanglement, which is sub-optimal for distributed tasks involving more than two users. Here we demonstrate quantum conference key agreement, a quantum communication protocol that exploits multi-partite entanglement to efficiently create identical keys between N users with up to N-1 rate advantage in constrained networks. We distribute four-photon Greenberger-Horne-Zeilinger (GHZ) states generated by high-brightness, telecom photon-pair sources across up to 50 km of fibre, implementing multi-user error correction and privacy amplification on resulting raw keys. Under finite-key analysis, we establish $1.15\times10^6$ bits of secure key, which are used to encrypt and securely share an image between the four users in a conference transmission. We have demonstrated a new protocol tailored for multi-node networks leveraging low-noise, long-distance transmission of GHZ states that will pave the way forward for future multiparty quantum information processing applications., Comment: 10 pages, 5 figures

The capability to reliably transmit and store quantum information is an essential building block for future quantum networks and processors. Gauging the ability of a communication link or quantum memory to preserve quantum correlations is therefore vital for their technological application. Here, we experimentally demonstrate a measurement-device-independent protocol for certifying that an unknown channel acts as an entanglement-preserving channel. Our results show that, even under realistic experimental conditions, including imperfect single-photon sources and the various kinds of noise---in the channel or in detection---where other verification means would fail or become inefficient, the present verification protocol is still capable of affirming the quantum behaviour in a faithful manner without requiring any trust on the measurement device., Comment: 5 pages, 3 figures, 6 pages supplementary materials

The first generation of multi-qubit quantum technologies will consist of noisy, intermediate-scale devices for which active error correction remains out of reach. To exploit such devices, it is thus imperative to use passive error protection that meets a careful trade-off between noise protection and resource overhead. Here, we experimentally demonstrate that single-qubit encoding can significantly enhance the robustness of entanglement and coherence of four-qubit graph states against local noise with a preferred direction. In particular, we explicitly show that local encoding provides a significant practical advantage for phase estimation in noisy environments. This demonstrates the efficacy of local unitary encoding under realistic conditions, with potential applications in multi-qubit quantum technologies for metrology, multi-partite secrecy and error correction., Comment: 7 figures

The scientific method relies on facts, established through repeated measurements and agreed upon universally, independently of who observed them. In quantum mechanics, the objectivity of observations is not so clear, most dramatically exposed in Eugene Wigner's eponymous thought experiment where two observers can experience seemingly different realities. The question whether these realities can be reconciled in an observer-independent way has long remained inaccessible to empirical investigation, until recent no-go-theorems constructed an extended Wigner's friend scenario with four observers that allows us to put it to the test. In a state-of-the-art 6-photon experiment, we realise this extended Wigner's friend scenario, experimentally violating the associated Bell-type inequality by 5 standard deviations. If one holds fast to the assumptions of locality and free-choice, this result implies that quantum theory should be interpreted in an observer-dependent way., Comment: 5+5 pages, 6 figures

Advanced photonic quantum technology relies on multi-photon interference which requires bright sources of high-purity single photons. Here, we implement a novel domain-engineering technique for tailoring the nonlinearity of a parametric down-conversion crystal. We create pairs of independently-heralded telecom-wavelength photons and achieve high heralding, brightness and spectral purities without filtering., Comment: 8 pages, 5 figures Imprecise comparison with the experimental results in [28] has been removed

It is commonly expected that quantum theory is universal, in that it describes the world at all scales. Yet, quantum effects at the macroscopic scale continue to elude our experimental observation. This fact is commonly attributed to decoherence processes affecting systems of sufficiently large number of constituent subsystems leading to an effective macro-scale beyond which a quantum description of the whole system becomes superfluous. Here, we show both theoretically and experimentally that the existence of such a scale is unjustifiable from an information-theoretic perspective. We introduce a variant of the Wigner's friend experiment in which a multiparticle quantum system is observed by the friend. The friend undergoes rapid decoherence through her interactions with the environment. In the usual version of this thought experiment, decoherence removes the need for Wigner to treat her as a quantum system. However, for our variant we prove theoretically and observe experimentally that there exist partitions of the subsystems in which the friend is entangled with one of the particles in assistance with the other particle, as observed by Wigner. Importantly, we show that the friend is indispensable for the entanglement to be observed. Hence Wigner is compelled to treat the friend as part of a larger quantum system. By analyzing our scenario in the context of a quantum key distribution protocol, we show that a semi-classical description of the experiment is suboptimal for security analysis, highlighting the significance of the quantum description of the friend., Comment: Comments and/or criticisms are welcome

We present an effcient experimental procedure that certifies non vanishing quantum capacities for qubit noisy channels. Our method is based on the use of a fixed bipartite entangled state, where the system qubit is sent to the channel input. A particular set of local measurements is performed at the channel output and the ancilla qubit mode, obtaining lower bounds to the quantum capacities for any unknown channel with no need of a quantum process tomography. The entangled qubits have a Bell state configuration and are encoded in photon polarization. The lower bounds are found by estimating the Shannon and von Neumann entropies at the output using an optimized basis, whose statistics is obtained by measuring only the three observables $\sigma_{x}\otimes\sigma_{x}$, $\sigma_{y}\otimes\sigma_{y}$ and $\sigma_{z}\otimes\sigma_{z}$., Comment: 5 pages and 3 figures in the principal article, and 4 pages in the supplementary material