Searcharxiv⌕ Search

arXiv subjects

Davide Venturelli

Publications and source records attributed to Davide Venturelli.

At least 55 records · Page 3Linked to original sources

Accelerating Continuous Variable Coherent Ising Machines via Momentum

The Coherent Ising Machine (CIM) is a non-conventional architecture that takes inspiration from physical annealing processes to solve Ising problems heuristically. Its dynamics are naturally continuous and described by a set of ordinary differential equations that have been proven to be useful for the optimization of continuous variables non-convex quadratic optimization problems. The dynamics of such Continuous Variable CIMs (CV-CIM) encourage optimization via optical pulses whose amplitudes are determined by the negative gradient of the objective; however, standard gradient descent is known to be trapped by local minima and hampered by poor problem conditioning. In this work, we propose to modify the CV-CIM dynamics using more sophisticated pulse injections based on tried-and-true optimization techniques such as momentum and Adam. Through numerical experiments, we show that the momentum and Adam updates can significantly speed up the CV-CIM's convergence and improve sample diversity over the original CV-CIM dynamics. We also find that the Adam-CV-CIM's performance is more stable as a function of feedback strength, especially on poorly conditioned instances, resulting in an algorithm that is more robust, reliable, and easily tunable. More broadly, we identify the CIM dynamical framework as a fertile opportunity for exploring the intersection of classical optimization and modern analog computing.

math.OC↗

Quantum-Enhanced Greedy Combinatorial Optimization Solver

Combinatorial optimization is a broadly attractive area for potential quantum advantage, but no quantum algorithm has yet made the leap. Noise in quantum hardware remains a challenge, and more sophisticated quantum-classical algorithms are required to bolster their performance. Here, we introduce an iterative quantum heuristic optimization algorithm to solve combinatorial optimization problems. The quantum algorithm reduces to a classical greedy algorithm in the presence of strong noise. We implement the quantum algorithm on a programmable superconducting quantum system using up to 72 qubits for solving paradigmatic Sherrington-Kirkpatrick Ising spin glass problems. We find the quantum algorithm systematically outperforms its classical greedy counterpart, signaling a quantum enhancement. Moreover, we observe an absolute performance comparable with a state-of-the-art semidefinite programming method. Classical simulations of the algorithm illustrate that a key challenge to reaching quantum advantage remains improving the quantum device characteristics.

quant-ph↗

Memory-induced oscillations of a driven particle in a dissipative correlated medium

The overdamped dynamics of a particle is in general affected by its interaction with the surrounding medium, especially out of equilibrium, and when the latter develops spatial and temporal correlations. Here we consider the case in which the medium is modeled by a scalar Gaussian field with relaxational dynamics, and the particle is dragged at constant velocity through the medium by a moving harmonic trap. This mimics the setting of an active microrheology experiment conducted in a near-critical medium. When the particle is displaced from its average position in the nonequilibrium steady state, its subsequent relaxation is shown to feature damped oscillations. This is similar to what has been recently predicted and observed in viscoelastic fluids, but differs from what happens in the absence of driving or for an overdamped Markovian dynamics, in which cases oscillations cannot occur. We characterize these oscillating modes in terms of the parameters of the underlying mesoscopic model for the particle and the medium, confirming our analytical predictions via numerical simulations.

cond-mat.stat-mech↗

Replica approach to the generalized Rosenzweig-Porter model

The generalized Rosenzweig-Porter model with real (GOE) off-diagonal entries arguably constitutes the simplest random matrix ensemble displaying a phase with fractal eigenstates, which we characterize here by using replica methods. We first derive analytical expressions for the average spectral density in the limit in which the size $N$ of the matrix is large but finite. We then focus on the number of eigenvalues in a finite interval and compute its cumulant generating function as well as the level compressibility, i.e., the ratio of the first two cumulants: these are useful tools to describe the local level statistics. In particular, the level compressibility is shown to be described by a universal scaling function, which we compute explicitly, when the system is probed over scales of the order of the Thouless energy. Interestingly, the same scaling function is found to describe the level compressibility of the complex (GUE) Rosenzweig-Porter model in this regime. We confirm our results with numerical tests.

cond-mat.dis-nn↗

Collective response to local perturbations: how to evade threats without losing coherence

Living groups move in complex environments and are constantly subject to external stimuli, predatory attacks and disturbances. An efficient response to such perturbations is vital to maintain the group's coherence and cohesion. Perturbations are often local, i.e. they are initially perceived only by few individuals in the group, but can elicit a global response. This is the case of starling flocks, that can turn very quickly to evade predators. In this paper, we investigate the conditions under which a global change of direction can occur upon local perturbations. Using minimal models of self-propelled particles, we show that a collective directional response occurs on timescales that grow with the system size and it is, therefore, a finite-size effect. The larger the group is, the longer it will take to turn. We also show that global coherent turns can only take place if i) the mechanism for information propagation is efficient enough to transmit the local reaction undamped through the whole group; and if ii) motility is not too strong, to avoid that the perturbed individual leaves the group before the turn is complete. No compliance with such conditions results in the group's fragmentation or in a non-efficient response.

cond-mat.stat-mech↗

Tracer particle in a confined correlated medium: an adiabatic elimination method

We present a simple and systematic procedure to determine the effective dynamics of a Brownian particle coupled to a rapidly fluctuating correlated medium, modeled as a scalar Gaussian field, under spatial confinement. The method allows us, in particular, to address the case in which the fluctuations of the medium are suppressed in the vicinity of the particle, as described by a quadratic coupling in the underlying Hamiltonian. As a consequence of the confinement of the correlated medium, the resulting effective Fokker-Planck equation features spatially dependent drift and diffusion coefficients. We apply our method to simplified fluid models of binary mixtures and microemulsions near criticality containing a colloidal particle, and we analyze the corrections to the stationary distribution of the particle position and the diffusion coefficient.

cond-mat.stat-mech↗

Inducing oscillations of trapped particles in a near-critical Gaussian field

We study the nonequilibrium dynamics of two particles confined in two spatially separated harmonic potentials and linearly coupled to the same thermally fluctuating scalar field, a cartoon for optically trapped colloids in contact with a medium close to a continuous phase transition. When an external periodic driving is applied to one of these particles, a nonequilibrium periodic state is eventually reached in which their motion synchronizes thanks to the field-mediated effective interaction, a phenomenon already observed in experiments. We fully characterize the nonlinear response of the second particle as a function of the driving frequency, and in particular far from the adiabatic regime in which the field can be assumed to relax instantaneously. We compare the perturbative, analytic solution to its adiabatic approximation, thus determining the limits of validity of the latter, and we qualitatively test our predictions against numerical simulations.

cond-mat.stat-mech↗

Numerical Gate Synthesis for Quantum Heuristics on Bosonic Quantum Processors

There is a recent surge of interest and insights regarding the interplay of quantum optimal control and variational quantum algorithms. We study the framework in the context of qudits which are, for instance, definable as controllable electromagnetic modes of a superconducting cavity system coupled to a transmon. By employing recent quantum optimal control approaches described in (Petersson and Garcia, 2021), we showcase control of single-qudit operations up to eight states, and two-qutrit operations, mapped respectively onto a single mode and two modes of the resonator. We discuss the results of numerical pulse engineering on the closed system for parametrized gates useful to implement Quantum Approximate Optimization Algorithm (QAOA) for qudits. The results show that high fidelity ($>$ 0.99) is achievable with sufficient computational effort for most cases under study, and extensions to multiple modes and open, noisy systems are possible. The tailored pulses can be stored and used as calibrated primitives for a future compiler in circuit quantum electrodynamics (cQED) systems.

quant-ph↗

Nonequilibrium relaxation of a trapped particle in a near-critical Gaussian field

We study the non-equilibrium relaxational dynamics of a probe particle linearly coupled to a thermally fluctuating scalar field and subject to a harmonic potential, which provides a cartoon for an optically trapped colloid immersed in a fluid close to its bulk critical point. The average position of the particle initially displaced from the position of mechanical equilibrium is shown to feature long-time algebraic tails as the critical point of the field is approached, the universal exponents of which are determined in arbitrary spatial dimensions. As expected, this behavior cannot be captured by adiabatic approaches which assume fast field relaxation. The predictions of the analytic, perturbative approach are qualitatively confirmed by numerical simulations.

cond-mat.stat-mech↗

A Finite-Range Search Formulation of Maximum Likelihood MIMO Detection for Coherent Ising Machines

The last couple of years have seen an emergence of physics-inspired computing for maximum likelihood MIMO detection. These methods involve transforming the MIMO detection problem into an Ising minimization problem, which can then be solved on an Ising Machine. Recent works have shown promising projections for MIMO wireless detection using Quantum Annealing optimizers and Coherent Ising Machines. While these methods perform very well for BPSK and 4-QAM, they struggle to provide good BER for 16-QAM and higher modulations. In this paper, we explore an enhanced CIM model, and propose a novel Ising formulation, which together are shown to be the first Ising solver that provides significant gains in the BER performance of large and massive MIMO systems, like $16\times16$ and $16\times32$, and sustain its performance gain even at 256-QAM modulation. We further perform a spectral efficiency analysis and show that, for a $16\times16$ MIMO with Adaptive Modulation and Coding, our method can provide substantial throughput gains over MMSE, achieving $2\times$ throughput for SNR $\leq25$ dB, and up to $1.5\times$ throughput for SNR $\geq 30$ dB.

cs.NI↗

Quantum computing hardware for HEP algorithms and sensing

Quantum information science harnesses the principles of quantum mechanics to realize computational algorithms with complexities vastly intractable by current computer platforms. Typical applications range from quantum chemistry to optimization problems and also include simulations for high energy physics. The recent maturing of quantum hardware has triggered preliminary explorations by several institutions (including Fermilab) of quantum hardware capable of demonstrating quantum advantage in multiple domains, from quantum computing to communications, to sensing. The Superconducting Quantum Materials and Systems (SQMS) Center, led by Fermilab, is dedicated to providing breakthroughs in quantum computing and sensing, mediating quantum engineering and HEP based material science. The main goal of the Center is to deploy quantum systems with superior performance tailored to the algorithms used in high energy physics. In this Snowmass paper, we discuss the two most promising superconducting quantum architectures for HEP algorithms, i.e. three-level systems (qutrits) supported by transmon devices coupled to planar devices and multi-level systems (qudits with arbitrary N energy levels) supported by superconducting 3D cavities. For each architecture, we demonstrate exemplary HEP algorithms and identify the current challenges, ongoing work and future opportunities. Furthermore, we discuss the prospects and complexities of interconnecting the different architectures and individual computational nodes. Finally, we review several different strategies of error protection and correction and discuss their potential to improve the performance of the two architectures. This whitepaper seeks to reach out to the HEP community and drive progress in both HEP research and QIS hardware.

quant-ph↗

Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints

We introduce multiple parametrized circuit ansätze and present the results of a numerical study comparing their performance with a standard Quantum Alternating Operator Ansatz approach. The ansätze are inspired by mixing and phase separation in the QAOA, and also motivated by compilation considerations with the aim of running on near-term superconducting quantum processors. The methods are tested on random instances of a weighted quadratic binary constrained optimization problem that is fully connected for which the space of feasible solutions has constant Hamming weight. For the parameter setting strategies and evaluation metric used, the average performance achieved by the QAOA is effectively matched by the one obtained by a "mixer-phaser" ansatz that can be compiled in less than half-depth of standard QAOA on most superconducting qubit processors.

quant-ph↗

Inter-generational comparison of quantum annealers in solving hard scheduling problems

We compare the performance of four quantum annealers, the D-Wave Two, 2X, 2000Q, and Advantage in solving an identical ensemble of a parametrized family of scheduling problems. These problems are NP-complete and, in fact, equivalent to vertex coloring problems. They are also practically motivated and closely connected to planning problems from artificial intelligence. We examine factors contributing to the performance differences while separating the contributions from hardware upgrades, support for shorter anneal times, and possible optimization of ferromagnetic couplings. While shorter anneal times can improve the time to solution (TTS) at any given problem size, the scaling of TTS with respect to the problem size worsens for shorter anneal times. In contrast, optimizing the ferromagnetic coupling improves both the absolute TTS and the scaling. There is a statistically significant improvement in performance between D-Wave Two and 2X and from all older generation annealers to Advantage, even when operated under identical anneal time and ferromagnetic couplings. However, the performance improvement from 2X to 2000Q requires the anneal time and ferromagnetic couplings to be optimized. Overall, owing to these inter-generational hardware improvements and optimizations, the scaling exponent reduces from $1.01 \pm 0.01$ on Two to $0.173 \pm 0.009$ on Advantage.

quant-ph↗

Practical Verification of Quantum Properties in Quantum Approximate Optimization Runs

In order to assess whether quantum resources can provide an advantage over classical computation, it is necessary to characterize and benchmark the non-classical properties of quantum algorithms in a practical manner. In this paper, we show that using measurements in no more than 3 out of the possible $3^N$ bases, one can not only reconstruct the single-qubit reduced density matrices and measure the ability to create coherent superpositions, but also possibly verify entanglement across all $N$ qubits participating in the algorithm. We introduce a family of generalized Bell-type observables for which we establish an upper bound to the expectation values in fully separable states by proving a generalization of the Cauchy-Schwarz inequality, which may serve of independent interest. We demonstrate that a subset of such observables can serve as entanglement witnesses for QAOA-MaxCut states, and further argue that they are especially well tailored for this purpose by defining and computing an entanglement potency metric on witnesses. A subset of these observables also certify, in a weaker sense, the entanglement in GHZ states, which share the $\mathbb{Z}_2$ symmetry of QAOA-MaxCut. The construction of such witnesses follows directly from the cost Hamiltonian to be optimized, and not through the standard technique of using the projector of the state being certified. It may thus provide insights to construct similar witnesses for other variational algorithms prevalent in the NISQ era. We demonstrate our ideas with proof-of-concept experiments on the Rigetti Aspen-9 chip for ansatze containing up to 24 qubits.

quant-ph↗

Physics-Inspired Heuristics for Soft MIMO Detection in 5G New Radio and Beyond

Overcoming the conventional trade-off between throughput and bit error rate (BER) performance, versus computational complexity is a long-term challenge for uplink Multiple-Input Multiple-Output (MIMO) detection in base station design for the cellular 5G New Radio roadmap, as well as in next generation wireless local area networks. In this work, we present ParaMax, a MIMO detector architecture that for the first time brings to bear physics-inspired parallel tempering algorithmic techniques [28, 50, 67] on this class of problems. ParaMax can achieve near optimal maximum-likelihood (ML) throughput performance in the Large MIMO regime, Massive MIMO systems where the base station has additional RF chains, to approach the number of base station antennas, in order to support even more parallel spatial streams. ParaMax is able to achieve a near ML-BER performance up to 160x160 and 80x80 Large MIMO for low-order modulations such as BPSK and QPSK, respectively, only requiring less than tens of processing elements. With respect to Massive MIMO systems, in 12x24 MIMO with 16-QAM at SNR 16 dB, ParaMax achieves 330 Mbits/s near-optimal system throughput with 4--8 processing elements per subcarrier, which is approximately 1.4x throughput than linear detector-based Massive MIMO systems.

cs.NI↗

Entanglement Across Separate Silicon Dies in a Modular Superconducting Qubit Device

Assembling future large-scale quantum computers out of smaller, specialized modules promises to simplify a number of formidable science and engineering challenges. One of the primary challenges in developing a modular architecture is in engineering high fidelity, low-latency quantum interconnects between modules. Here we demonstrate a modular solid state architecture with deterministic inter-module coupling between four physically separate, interchangeable superconducting qubit integrated circuits, achieving two-qubit gate fidelities as high as 99.1$\pm0.5$\% and 98.3$\pm$0.3\% for iSWAP and CZ entangling gates, respectively. The quality of the inter-module entanglement is further confirmed by a demonstration of Bell-inequality violation for disjoint pairs of entangled qubits across the four separate silicon dies. Having proven out the fundamental building blocks, this work provides the technological foundations for a modular quantum processor: technology which will accelerate near-term experimental efforts and open up new paths to the fault-tolerant era for solid state qubit architectures.

quant-ph↗

Quantum Annealing for Large MIMO Downlink Vector Perturbation Precoding

In a multi-user system with multiple antennas at the base station, precoding techniques in the downlink broadcast channel allow users to detect their respective data in a non-cooperative manner. Vector Perturbation Precoding (VPP) is a non-linear variant of transmit-side channel inversion that perturbs user data to achieve full diversity order. While promising, finding an optimal perturbation in VPP is known to be an NP-hard problem, demanding heavy computational support at the base station and limiting the feasibility of the approach to small MIMO systems. This work proposes a radically different processing architecture for the downlink VPP problem, one based on Quantum Annealing (QA), to enable the applicability of VPP to large MIMO systems. Our design reduces VPP to a quadratic polynomial form amenable to QA, then refines the problem coefficients to mitigate the adverse effects of QA hardware noise. We evaluate our proposed QA based VPP (QAVP) technique on a real Quantum Annealing device over a variety of design and machine parameter settings. With existing hardware, QAVP can achieve a BER of $10^{-4}$ with 100$μ$s compute time, for a 6$\times$6 MIMO system using 64 QAM modulation at 32 dB SNR.

cs.NI↗

Quantum Integer Programming (QuIP) 47-779: Lecture Notes

This lecture series on Quantum Integer Programming (QuIP) -- created by Professor Sridhar Tayur, David E. Bernal, and Dr. Davide Venturelli, a collaboration between CMU and USRA, with the support from Amazon Braket during Fall 2020 -- is intended for students and researchers interested in Integer Programming and the potential of near term quantum and quantum-inspired computing in solving optimization problems. Originally created for Tepper School of Business course 47-779 (at CMU), these were also used for the course ID5840 (at IIT-Madras, by Professors Anil Prabhakar and Prabha Mandayam) whose students (listed at the beginning of each lecture) were scribes. Dr. Vikesh Siddhu, post-doc in CMU Quantum Computing Group, assisted during the lectures, student projects, and with proof-reading this scribe. Through these lectures one will learn to formulate a problem and map it to a Quadratic Unconstrained Binary Optimization (QUBO) problem, understand various mapping and techniques like the Ising model, Graver Augmented Multiseed Algorithm (GAMA), Simulated or Quantum Annealing and QAOA, and ideas on how to solve these Integer problems using these quantum and classical methods.

quant-ph↗