Searcharxiv⌕ Search

arXiv subjects

Ruge Lin

Publications and source records attributed to Ruge Lin.

11 recordsLinked to original sources

Readout errors limit how far adaptive quantum circuits can entangle

Measurement and feedforward let quantum circuits entangle arbitrarily distant qubits in constant depth if measurement records are perfect and classical communication is instantaneous. We allow each reported bit to flip independently with a fixed probability between zero and one half, keeping all gates ideal. Consider a square-lattice device with a unique path between the endpoints and a bounded number of qubits per site. Beyond $\exp[O(D^3)]$ steps along that path, every depth-$D$ circuit starting from a product state leaves the endpoints exactly separable in every record, however rare. By copying outcomes onto spare qubits beside the path before readout, we attain a reach of $\exp[Θ(D^3)]$ for a nondestructive parity measurement at fixed accuracy without postselection. On a one-dimensional chain, the optimal reach for the same measurement is $\exp[Θ(D^2)]$. On any interaction graph, a constant-depth circuit starting from a product state needs $Ω(L\ln L)$ qubits to entangle endpoints at graph distance $L$. The reliability of local readout thus limits the depth advantage of adaptive circuits for long-range entanglement.

quant-ph↗

A Compass on the Quantum State Sphere: The Hopf Ansatz for Arbitrary Pure-State Optimization

Optimizing an arbitrary pure state requires more than a circuit that can prepare it: one also needs coordinates, local distance information, and measurable derivative directions. We introduce the Hopf ansatz, a binary-tree circuit for arbitrary normalized real and complex state vectors. Internal angles split probability between subtrees, while leaf phases supply the complex degrees of freedom. The same tree recovers physical angles from known amplitudes, gives an analytic diagonal metric on the state-vector sphere, and prepares each nonzero coordinate tangent as a normalized state. For Hamiltonian objectives and other costs with the same local transition-moment form, each gradient component is a known metric factor times a transition moment between the current state and a tangent state. Signed branch states express these moments through expectation-value measurements. Indexed preparation groups magnitude tangents by tree depth and collects complex phase tangents into one leaf-indexed block. The number of compiled gradient-access circuit families is logarithmic in Hilbert-space dimension; measurement repetitions needed for a prescribed accuracy remain a separate statistical cost. In deterministic real-state benchmarks with exact objectives and gradients and known global optima, metric-aware Hopf updates reach numerical-precision median gaps. Relative to coordinate-Adam baselines, they yield smaller mean final gaps in variational eigensolver tests and concentrate more runs at numerical precision in metrology-inspired tests. The Hopf ansatz thus supplies a compass for arbitrary pure-state optimization, with coordinates, geometry, and measurable directions in one circuit structure.

quant-ph↗

Compass in the Mirror: Quantum Backpropagation with the Hopf Ansatz

A variational quantum state may have many control angles, and its complete gradient contains one derivative for each. The task is to turn access to selected derivatives into a shared finite-shot record for the complete vector. The Hopf ansatz supplies the setting: it constructs any normalized pure state from nested two-way magnitude splits and, for complex states, leaf phases, with one directly programmed angle per split or phase. Earlier Hopf constructions prepare the state, recover coordinates from known amplitudes, and provide indexed derivative access. With a phase-calibrated controlled reflection, the inverse Hopf frame maps each normalized magnitude direction to a computational label, so every all-$X$ outcome contributes to every magnitude derivative. A separate signed leaf record supplies the complex phase block. A checkpoint variant reverses only the suffix below a selected depth and returns that layer's gradient block. For a complete chart with $M$ real-valued parameters, sufficient execution counts are $\mathcal{O}(\log\log M)$ for the global method and $\mathcal{O}(\log M\log\log M)$ for the complete checkpoint schedule at fixed additive coordinate accuracy and confidence. The global saving is record reuse, not a reduction of the $M$-entry output. Under the designated direct-angle schedules, the global method's assigned Hopf CNOT work and input/output-inclusive storage have at most logarithmic overhead relative to a matched scalar evaluation. The same Hopf geometry thus carries a state forward and the objective's complete coordinate response backward.

quant-ph↗

Quantum optimization with exact geodesic transport

We introduce an architecture for variational quantum algorithms that can be efficiently trained via parameter updates along exact geodesics on the Riemannian state manifold. This features a parameter-optimal circuit ansatz which supersedes known quantum natural gradient methods by removing expensive estimations of the metric tensor and provably reducing gradient estimation costs by $62.5\%$. Moreover, the framework also naturally incorporates conjugate gradients as a built-in feature, giving an accelerated descent method with convergence guarantees that we dub exact geodesic transport with conjugate gradients. Numerical benchmarks against state-of-the-art variational methods for ground-state preparation of molecular Hamiltonians or $1$-dimensional spin chains (both with and without particle-number conservation) up to $n=16$ qubits show reductions of over one order of magnitude in the number of optimization steps, with global convergence even for degenerate cases and competitive quantum-resource scalings. In addition, we perform proof-of-principle demonstrations on IonQ's Forte quantum processor, showcasing deployment of pre-trained circuits for the $H_{3}^{+}$ molecule and experimental training for $H_{2}$. Our work enables quantum machine learning applications with shorter training runtime, with implications at the interface of quantum simulation, differential geometry, and optimal control theory.

quant-ph↗

Quantum encoder for fixed Hamming-weight subspaces

We present an exact $n$-qubit computational-basis amplitude encoder of real- or complex-valued data vectors of $d=\binom{n}{k}$ components into a subspace of fixed Hamming weight $k$. This represents a polynomial space compression of degree $k$. The circuit is optimal in that it expresses an arbitrary data vector using only $d-1$ (controlled) Reconfigurable Beam Splitter (RBS) gates and is constructed by an efficient classical algorithm that sequentially generates all bitstrings of weight $k$ and identifies the gates that superpose the corresponding states with the correct amplitudes. An explicit compilation into CNOTs and single-qubit gates is presented, with the total CNOT-gate count of $\mathcal{O}(k\, d)$ provided in analytical form. In addition, we show how to load data in the binary basis by sequentially stacking encoders of different Hamming weights using $\mathcal{O}(d\,\log(d))$ CNOT gates. Moreover, using generalized RBS gates that mix states of different Hamming weights, we extend the construction to efficiently encode arbitrary sparse vectors. Experimentally, we perform a proof-of-principle demonstration of our scheme on a commercial trapped-ion quantum computer. We successfully upload a $q$-Gaussian probability distribution in the non-log-concave regime with $n = 6$ and $k = 2$. We also showcase how the effect of hardware noise can be alleviated by quantum error mitigation. Numerically, we show how our encoder can improve the performance of variational quantum algorithms for problems that include particle-preserving symmetries. Our results constitute a versatile framework for quantum data compression with various potential applications in fields such as quantum chemistry, quantum machine learning, and constrained combinatorial optimizations.

quant-ph↗

Arithmetic sequences as quantum states

We consider arithmetic sequences, here defined as ordered lists of positive integers. Any such a sequence can be cast onto a quantum state, enabling the quantification of its `surprise' through von Neumann entropy. We identify typical sequences that maximize entanglement entropy across all bipartitions and derive an analytical approximation as a function of the sequence length. This quantum-inspired approach offers a novel perspective for analyzing randomness in arithmetic sequences.

quant-ph↗

Entanglement Trajectory and its Boundary

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.

quant-ph↗

Quantum representation of finite groups

The concept of quantum representation of finite groups (QRFG) has been a fundamental aspect of quantum computing for quite some time, playing a role in every corner, from elementary quantum logic gates to the famous Shor's and Grover's algorithms. In this article, we provide a formal definition of this concept using both group theory and differential geometry. Our work proves the existence of a quantum representation for any finite group and outlines two methods for translating each generator of the group into a quantum circuit, utilizing gate decomposition of unitary matrices and variational quantum algorithms. Additionally, we provide numerical simulations of an explicit example on an open-access platform. Finally, we demonstrate the usefulness and potential of QRFG by showing its role in the implementation of some quantum algorithms and quantum finite automata.

quant-ph↗

Exact analytical relation between the entropies and the dominant eigenvalue of random reduced density matrices

In this paper, we show how the entropy (including the von Neumann entropy obtained by tracing across various sizes of subsystems, the entanglement gap, as well as different degrees of Rényi entropy) of the random reduced density matrices are related to their dominant eigenvalue. Analytical results are deduced from Random Matrix Theory (RMT) for decentralized Wishart matrices and backed up by computer simulations. The correlation between our study and entanglement generated by quantum computing is provided with various examples.

quant-ph↗

Quantum computation capability verification protocol for NISQ devices with dihedral coset problem

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 benchmarking protocol for locally fully connected (LFC) quantum architecture and aims to be performed on current and near-future quantum resources. We conduct a 4-qubit experiment on one of IBM Q devices.

quant-ph↗

Solving systems of Boolean multivariate equations with quantum annealing

Polynomial systems over the binary field have important applications, especially in symmetric and asymmetric cryptanalysis, multivariate-based post-quantum cryptography, coding theory, and computer algebra. In this work, 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.

quant-ph↗