Ruge Lin

Ruge Lin

Auto-generated profile, based on publicly available information

Ruge Lin

Quantum Research Centre Technology Innovation Institute United Arab Emirates

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 April 2025 in Physical Review Applied
Verified
Journal Article
Closed access
RFRenato M.S. Farias
Renato M.S. Farias
TMThiago O. Maciel
Thiago O. Maciel
GCGiancarlo Camilo
Giancarlo Camilo
RLRuge Lin
Ruge Lin
SRSergi Ramos-Calderer
Sergi Ramos-Calderer
LALeandro Aolita
Leandro Aolita

7 February 2022 in Physical Review Research
Verified
Journal Article
Open access
PDF file
SRSergi Ramos-Calderer
Sergi Ramos-Calderer
CBCarlos Bravo-Prieto
Carlos Bravo-Prieto
RLRuge Lin
Ruge Lin
EBEmanuele Bellini
Emanuele Bellini
MMMarc Manzano
Marc Manzano
JLJosé I. Latorre
José I. Latorre
Polynomial systems over the binary field have important applications, especially in symmetric and asymmetric cryptanalysis, multivariate-based postquantum cryptography, coding theory, and computer algebra. In this paper, we study the quantum annealing model for solving Boolean systems of multivariate equations of degree 2, usually referred to as the multivariate quadratic problem. We present different methodologies to embed the problem into a Hamiltonian that can be solved by available quantum annealing platforms. In particular, we provide three embedding options, and we highlight their differences in terms of quantum resources. Moreover, we design a machine-agnostic algorithm that adopts an iterative approach to better solve the problem Hamiltonian by repeatedly reducing the search space. Finally, we use D-Wave devices to successfully implement our methodologies on several instances of the multivariate quadratic problem.

8 March 2024 in arXiv
Verified
Preprint
Open access
PDF file
RLRuge Lin
Ruge Lin
In this article, we present a novel approach to investigating entanglement in the context of quantum computing. Our methodology involves analyzing reduced density matrices at different stages of a quantum algorithm's execution and representing the dominant eigenvalue and von Neumann entropy on a graph, creating an "entanglement trajectory." To establish the trajectory's boundaries, we employ random matrix theory. Through the examination of examples such as quantum adiabatic computation, the Grover algorithm, and the Shor algorithm, we demonstrate that the entanglement trajectory remains within the established boundaries, exhibiting unique characteristics for each example. Moreover, we show that these boundaries and features can be extended to trajectories defined by alternative entropy measures. The entanglement trajectory serves as an invariant property of a quantum system, maintaining consistency across varying situations and definitions of entanglement. Numerical simulations accompanying this research are available via open access.

22 July 2022 in Physical Review A
Verified
Journal Article
Closed access
PDF file
RLRuge Lin
Ruge Lin
WWWeiqiang Wen
Weiqiang Wen
In this article, we propose an interactive protocol for one party (the verifier) holding a quantum computer to verify the quantum computation power of another party's (the prover) device via a one-way quantum channel. This protocol is referred to as the dihedral coset problem (DCP) challenge. The verifier needs to prepare quantum states encoding secrets (DCP samples) and send them to the prover. The prover is then tasked with recovering those secrets with a certain accuracy. Numerical simulation demonstrates that this accuracy is sensitive to errors in quantum hardware. Additionally, the DCP challenge serves as a benchmarking protocol for locally fully connected quantum architecture and aims to be performed on current and near-future quantum resources. We conduct a 4-qubit experiment on one of the IBM Q devices.

14 March 2024 in Quantum
Verified
Journal Article
Open access
PDF file
RLRuge Lin
Ruge Lin
In this article, we present a novel approach to investigating entanglement in the context of quantum computing. Our methodology involves analyzing reduced density matrices at different stages of a quantum algorithm's execution and representing the dominant eigenvalue and von Neumann entropy on a graph, creating an "entanglement trajectory." To establish the trajectory's boundaries, we employ random matrix theory. Through the examination of examples such as quantum adiabatic computation, the Grover algorithm, and the Shor algorithm, we demonstrate that the entanglement trajectory remains within the established boundaries, exhibiting unique characteristics for each example. Moreover, we show that these boundaries and features can be extended to trajectories defined by alternative entropy measures. The entanglement trajectory serves as an invariant property of a quantum system, maintaining consistency across varying situations and definitions of entanglement. Numerical simulations accompanying this research are available via open access.