AOAsier Piñeiro Orioli

Asier Piñeiro Orioli

*This is an algorithmically generated author record based on publicly available information.

Asier Piñeiro Orioli has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A quantum algorithm for one-shot signatures

    by Gopikrishnan Muraleedharan, Minh Thuy Truc Pham, Vir Pathak, Thomas Gardner, Chuanqi Zhang, Samuel Crew, Tom Hartweg, Adrian Aasen, Guido Masella, Vase Moeini, et al.

    We provide a pre-obfuscation circuit-level implementation of an efficient one shot signature scheme, which has known applications to delegated signatures, secure token transfer, and publicly verifiable randomness. The algorithm consists of two stages: a key generation stage where a classical public key/quantum secret key pair is produced, and a signing stage where the quantum secret key is processed with a message string to produce a classical signature. There is no algorithmic error in the construction and the signed message can be efficiently checked by a classical verifier. Our scheme works by preparing a superposition over elements of a random affine coset determined by the output of a puncturable pseudorandom function, together with a circuit that tests coset membership. The logical qubit number scales like Θ(κ log(r) + n + l) and the gate complexity scales like Θ(n3 + nl), where r is the public key size, n + l is the signature size, l is the message size, and κ = Ω(n) is the cryptographic security parameter. We provide explicit qubit and gate counts before obfuscation. A secure instantiation additionally requires modified key generation and a security proof for the resulting obfuscated construction.

  • Open Access

    Comparative Benchmarking of Utility-Scale Quantum Emulators

    by Anna Leonteva, Guido Masella, Maxime Outteryck, Asier Peiro Orioli, Shannon Whitlock

    Evaluating quantum algorithms at utility-scale—involving more than 100 qubits—is a key step toward advancing real-world applications of quantum computing. In this study, we benchmark seven state-of-the-art quantum emulators employing techniques such as tensor networks, matrix product states (MPS), decision diagrams, and factorized ket based methods, running on CPU based hardware and focusing on effectively exact simulations. Performance is assessed on 13 benchmark circuits from the MQTBench library, spanning circuit sizes from 4 to 1,024 qubits. Our results reveal that MPS-based emulators outperform other approaches overall, successfully solving 8 benchmarks up to the maximum size of 1,024 qubits and 12 benchmarks up to at least 100 qubits in less than 5 minutes. We find evidence that all circuits except a random one can be simulated in polynomial time. This work demonstrates that quantum emulators can faithfully simulate a broad range of large and complex universal quantum circuits with high fidelity, far beyond the limits of statevector simulators and today’s quantum hardware.