arXiv subjects

Samuele Ferracin

Publications and source records attributed to Samuele Ferracin.

11 recordsLinked to original sources

arXiv2026

Phonon controlled mechanical memory via pinning and depinning of transition waves

Multistable mechanical metamaterials enable programmable transitions between discrete stable states through propagating kink transition waves (TWs). Yet controlling these kinks typically requires local actuation or high-energy deformation, limiting scalability. Here we demonstrate a universal strategy for pinning and depinning TWs using local defects and boundary phonon excitations. Inspired by phonon-dislocation interactions in crystalline solids, we use pairs of phonons that form a beating envelope resonant with the pinned kink's translational mode, which lies within a phononic band gap. This resonant coupling efficiently transfers energy to the kink, allowing it to overcome defect barriers and propagate across impurities. The proposed mechanism enables application of these systems as information processing units in mechanical computing, namely as scalable and more robust mechanical memory.

physics.app-ph↗

arXiv2025

Effect of discreteness on domain wall stability in a plate coupled to a foundation of bistable elements

Surfaces and structures capable of multiple stable configurations have attracted growing interest for on-demand shape morphing. In this work, we consider an elastic compliant plate coupled to a two-dimensional foundation comprising an array of bistable elements, a system that can form and retain complex continuous morphologies without sustained actuation via creation of stable domain walls separating regions in different stable states. These domain walls exhibit three distinct behaviors: expansion, shrinking, and metastable pinning. These arise from two limits of foundation discreteness. In the continuum limit, where bistable units are strongly coupled, domain walls undergo global phase transitions analogous to first-order phase transitions. In the anti-continuum limit, discreteness introduces Peierls-Nabarro-type energy modulations that lead to metastable pinning. To quantify these behaviors and the transition between the two limits, we develop a reduced-order model that captures the total potential energy of configurations with domain walls and validate it using finite element analysis (FEA). For axisymmetric domain walls, the model yields phase diagrams identifying the regimes of expansion, shrinking, and pinning as functions of bistable-potential asymmetry, relative foundation discreteness, and domain-wall size. We then extend the analysis to non-axisymmetric geometries and establish local geometric criteria that predict the stability of convex and concave polygonal domain walls, confirmed by simulations. Together, these results clarify how discreteness enables stability through energy-landscape modulation, provide predictive design rules for multistable reconfigurable surfaces, and offer insights into domain-wall stability more generally in elastically coupled multistable metamaterials.

physics.app-ph↗

arXiv2025

When Clifford benchmarks are sufficient; estimating application performance with scalable proxy circuits

The goal of benchmarking is to determine how far the output of a noisy system is from its ideal behavior; this becomes exceedingly difficult for large quantum systems where classical simulations become intractable. A common approach is to turn to circuits comprised of elements of the Clifford group (e.g., CZ, CNOT, $\pi$ and $\pi/2$ gates), which probe quantum behavior but are nevertheless efficient to simulate classically. However, there is some concern that these circuits may overlook error sources that impact the larger Hilbert space. In this manuscript, we show that for a broad class of error models these concerns are unwarranted. In particular, we show that, for error models that admit noise tailoring by Pauli twirling, the diamond norm and fidelity of any generic circuit is well approximated by the fidelities of proxy circuits composed only of Clifford gates. We discuss methods for extracting the fidelities of these Clifford proxy circuits in a manner that is robust to errors in state preparation and measurement and demonstrate these methods in simulation and on IBM Quantum's fleet of deployed heron devices.

quant-ph↗

arXiv2024

A Practical Introduction to Benchmarking and Characterization of Quantum Computers

Rapid progress in quantum technology has transformed quantum computing and quantum information science from theoretical possibilities into tangible engineering challenges. Breakthroughs in quantum algorithms, quantum simulations, and quantum error correction are bringing useful quantum computation closer to fruition. These remarkable achievements have been facilitated by advances in quantum characterization, verification, and validation (QCVV). QCVV methods and protocols enable scientists and engineers to scrutinize, understand, and enhance the performance of quantum information-processing devices. In this tutorial, we review the fundamental principles underpinning QCVV, and introduce a diverse array of QCVV tools used by quantum researchers. We define and explain QCVV's core models and concepts -- quantum states, measurements, and processes -- and illustrate how these building blocks are leveraged to examine a target system or operation. We survey and introduce protocols ranging from simple qubit characterization to advanced benchmarking methods. Along the way, we provide illustrated examples and detailed descriptions of the protocols, highlight the advantages and disadvantages of each, and discuss their potential scalability to future large-scale quantum computers. This tutorial serves as a guidebook for researchers unfamiliar with the benchmarking and characterization of quantum computers, and also as a detailed reference for experienced practitioners.

quant-ph↗

arXiv2024

Shape-retaining beam-like morphing structures via localized snap through

In this study, we present a concept of morphing structure -- featuring an arch mounted on a compliant base -- that can be reconfigured via snap-through buckling and leverages bistability to retain its morphed shape. We show that one-dimensional arrays of such units yield beam-like structures that, upon localized snapping, can attain multiple, morphologically distinct stable shapes. Units are modeled using discrete elastic rods, a reduced-order formulation for beams and beam structures, and the results are validated via experiments. We leverage our model to understand the influence of the geometrical design parameters on the response and final shape of a unit. We then show that the morphed shapes of arrays of units can be predicted by concatenating results of simulations on single units, and leverage this idea to inverse-design structures that can be snapped into target stable shapes. Ultimately, our work suggests an up-scalable way to create shape-retaining morphing structures with target stable shapes.

physics.app-ph↗

arXiv2023

Extending the Computational Reach of a Superconducting Qutrit Processor

Quantum computing with qudits is an emerging approach that exploits a larger, more-connected computational space, providing advantages for many applications, including quantum simulation and quantum error correction. Nonetheless, qudits are typically afflicted by more complex errors and suffer greater noise sensitivity which renders their scaling difficult. In this work, we introduce techniques to tailor and mitigate arbitrary Markovian noise in qudit circuits. We experimentally demonstrate these methods on a superconducting transmon qutrit processor, and benchmark their effectiveness for multipartite qutrit entanglement and random circuit sampling, obtaining up to 3x improvement in our results. To the best of our knowledge, this constitutes the first ever error mitigation experiment performed on qutrits. Our work shows that despite the intrinsic complexity of manipulating higher-dimensional quantum systems, noise tailoring and error mitigation can significantly extend the computational reach of today's qudit processors.

quant-ph↗

arXiv2023

The Error Reconstruction and Compiled Calibration of Quantum Computing Cycles

Quantum computers are inhibited by physical errors that occur during computation. For this reason, the development of increasingly sophisticated error characterization and error suppression techniques is central to the progress of quantum computing. Error distributions are considerably influenced by the precise gate scheduling across the entire quantum processing unit. To account for this holistic feature, we may ascribe each error profile to a (clock) cycle, which is a scheduled list of instructions over an arbitrarily large fraction of the chip. A celebrated technique known as randomized compiling introduces some randomness within cycles' instructions, which yields effective cycles with simpler, stochastic error profiles. In the present work, we leverage the structure of cycle benchmarking (CB) circuits as well as known Pauli channel estimation techniques to derive a method, which we refer to as cycle error reconstruction (CER), to estimate with multiplicative precision the marginal error distribution associated with any effective cycle of interest. The CER protocol is designed to scale for an arbitrarily large number of qubits. Furthermore, we develop a fast compilation-based calibration method, referred to as stochastic calibration (SC), to identify and suppress local coherent error sources occurring in any effective cycle of interest. We performed both protocols on IBM-Q 5-qubit devices. Via our calibration scheme, we obtained up to a 5-fold improvement of the circuit performance.

quant-ph↗

arXiv2022

Efficiently improving the performance of noisy quantum computers

Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We develop and experimentally validate two efficient error mitigation protocols named "Noiseless Output Extrapolation" and "Pauli Error Cancellation" that can drastically enhance the performance of quantum circuits composed of noisy cycles of gates. By combining popular mitigation strategies such as probabilistic error cancellation and noise amplification with efficient noise reconstruction methods, our protocols can mitigate a wide range of noise processes that do not satisfy the assumptions underlying existing mitigation protocols, including non-local and gate-dependent processes. We test our protocols on a four-qubit superconducting processor at the Advanced Quantum Testbed. We observe significant improvements in the performance of both structured and random circuits, with up to $86\%$ improvement in variation distance over the unmitigated outputs. Our experiments demonstrate the effectiveness of our protocols, as well as their practicality for current hardware platforms.

quant-ph↗

arXiv2021

Experimental accreditation of outputs of noisy quantum computers

We provide and experimentally demonstrate an accreditation protocol that upper-bounds the variation distance between noisy and noiseless probability distributions of the outputs of arbitrary quantum computations. We accredit the outputs of twenty-four quantum circuits executed on programmable superconducting hardware, ranging from depth nine circuits on ten qubits to depth twenty-one circuits on four qubits. Our protocol requires implementing the "target" quantum circuit along with a number of random Clifford circuits and subsequently post-processing the outputs of these Clifford circuits. Importantly, the number of Clifford circuits is chosen to obtain the bound with the desired confidence and accuracy, and is independent of the size and nature of the target circuit. We thus demonstrate a practical and scalable method of ascertaining the correctness of the outputs of arbitrary-sized noisy quantum computers--the ultimate arbiter of the utility of the computer itself.

quant-ph↗

arXiv2018

Accrediting outputs of noisy intermediate-scale quantum computing devices

We present an accreditation protocol for the outputs of noisy intermediate-scale quantum devices. By testing entire circuits rather than individual gates, our accreditation protocol can provide an upper-bound on the variation distance between noisy and noiseless probability distribution of the outputs of the target circuit of interest. Our accreditation protocol requires implementation of quantum circuits no larger than the target circuit, therefore it is practical in the near term and scalable in the long term. Inspired by trap-based protocols for the verification of quantum computations, our accreditation protocol assumes that noise in single-qubit gates is bounded (but potentially gate-dependent) in diamond norm. We allow for arbitrary spatial and temporal correlations in the noise affecting state preparation, measurements and two-qubit gates. We describe how to implement our protocol on real-world devices, and we also present a novel cryptographic protocol (which we call `mesothetic' protocol) inspired by our accreditation protocol.

quant-ph↗

arXiv2018

Reducing resources for verification of quantum computations

We present two verification protocols where the correctness of a "target" computation is checked by means of "trap" computations that can be efficiently simulated on a classical computer. Our protocols rely on a minimal set of noise-free operations (preparation of eight single-qubit states or measurement of four observables, both on a single plane of the Bloch sphere) and achieve linear overhead. To the best of our knowledge, our protocols are the least demanding techniques able to achieve linear overhead. They represent a step towards further reducing the quantum requirements for verification.

quant-ph↗