SearcharxivSearch

arXiv subjects

Eugene Dumitrescu

Publications and source records attributed to Eugene Dumitrescu.

At least 19 recordsLinked to original sources

Hamiltonian Learning at Scale

Learning a quantum system's Hamiltonian is crucial for understanding and controlling its dynamics and has recently become a topic of widespread interest. To understand the learning protocol's error tolerances, i.e. its stability in the presence of inevitable errors, this work utilizes tensor network techniques to emulate Hamiltonian learning workflows at scale and with noise. Specifically, we employed a Hamiltonian learning technique based on approximate stationary states which are constructed using matrix product tools. We provide analytic bounds on the Hamiltonian learning estimation errors and perform numerical simulations that highlight learning error's stability under two families of errors. Using our workflow, we are able to scale up the protocol and learn mixed-field Ising model Hamiltonians of an $N=300$ site spin chain. By simulating the protocol at large scale, and empirically studying its practical limitations, our analysis of how errors affect the Hamiltonian learning process provides valuable lessons for future experiments. We conclude by discussing the avenues our work opens as well as future work that can support Hamiltonian learning experiments.

quant-ph

Real-time heralded non-Gaussian teleportation resource-state generator

Quantum teleportation is a fundamental quantum communications primitive that requires an entangled resource state. In the continuous-variable regime, non-Gaussian entangled resources have been shown theoretically to improve teleportation fidelity compared to Gaussian squeezed vacuum. We experimentally demonstrate a heralded two-mode resource state for non-Gaussian teleportation capable of real-time use. We characterize this state with two-mode homodyne tomography showing it has fidelity $F=0.973\pm 0.005$ with the expected resource state. Real-time use is enabled by a photon-subtraction orchestrator system performing live coincidence detection and outputting low-jitter and low-latency heralding signals. Live collection of real-time quadrature measurements of photon-subtracted states is enabled by the development of a synchronized homodyne detection server, where the orchestrator system queries the server to collect the real-time quadrature samples corresponding to the heralded state. These results demonstrate significant advancement in enabling the use of heralded non-Gaussian states in quantum networking protocols, especially in the context of quantum repeaters, non-Gaussian quantum sensing, and measurement-based quantum computing.

quant-ph

Matrix Product Operators In The Age of Block Encoding

We develop a block-encoding compiler that treats matrix product operators as compressed, virtual-path linear combination of unitaries programs. The compiler constructs conditional PREP and local SELECT stages directly from a parent matrix product operator, establishing tensor networks as structured quantum intermediate representations that can be efficiently compiled to block-encoded circuits. We apply the construction to real-time evolution in the Heisenberg chain and two perturbed Heisenberg-family models. Across the regimes studied, the compressed, approximately unitary propagator MPOs retain mild bond dimension and LCU normalization. Relative to an LCU that explicitly lists the $\mathcal{O}(N^K)$ Pauli-product branches of an order-K truncated Taylor polynomial, our virtual-transition implementation replaces combinatorial branch enumeration by a circuit complexity scaling as $\mathcal{O}(α_{\rm MPO}Nχ^2)$, approaching $\mathcal{O}(Nχ^2)$ when $α_{\rm MPO}$ remains mild. We numerically characterize how truncation order, bond-dimension budget, and system size affect approximation error, normalization, and compiler cost. These results demonstrate how classically compressed tensor-network representations can serve as quantum compiler intermediate representations for block encoding and opens new avenues to accelerate quantum algorithms.

quant-ph

Locally Purified Maximally Mixed States At Scale: Entanglement Pruning and Symmetries

Locally Purified Density Operators (LPDOs) are state-of-the-art tensor network ansatze candidates that efficiently represent mixed quantum states at scale. However, given their non-uniqueness, their representational complexity is generally sub-optimal in practical computations. In this work we perform a comprehensive numerical and analytical analysis and resolve this issue in the experimentally relevant limit where noise depolarizes the density operator into a maximally mixed state. To resolve the sub-optimality issue, we analyze two numerical tools, one analytic method, and detail the relations between them. The numerical tools used are fidelity-preserving truncations and isometric gauge transformations leveraging Riemannian optimizations over entropic objective functions. In addition, by invoking the injectivity and symmetry constraints of the maximally mixed LPDO, we also present analytical closed-form expressions for the disentangler and discuss their relation to numerical optimizers. Further, away from the maximally mixed state, our simulations highlight how the truncation threshold smoothly interpolate, as a function of depolarization, between established matrix product results and our new results. Our work shows how, by minimizing the resources required to represent key states of practical interest in experiment, the efficiency of tensor network algorithms can be substantially increased. This paves the path for uncovering tensor network's fundamental scalability limits and latent potential in representing the wide locus of mixed quantum states that are accessible on near-term quantum devices.

quant-ph

Sampling two-dimensional isometric tensor network states

Sampling a quantum system's underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Tensor networks are an invaluable tool for efficiently representing states of large quantum systems with limited entanglement. Algorithms for sampling one-dimensional (1D) tensor networks are well-established and utilized in several 1D tensor network methods. In this paper we introduce two novel sampling algorithms for two-dimensional (2D) isometric tensor network states (isoTNS) that generalize existing 1D tensor networks sampling algorithms. Our first proposed algorithm performs independent sampling and yields a single configuration together with its associated probability. The second algorithm employs a greedy search strategy to identify $K$ high-probability configurations and their corresponding probabilities. Numerical results demonstrate the effectiveness of these algorithms across quantum states with varying entanglement and system size.

quant-ph

Composite-Dimensional Topological Codes with Boundaries and Defects

We introduce new algorithms and provide example constructions of stabilizer models for the gapped boundaries, domain walls, and $0D$ defects of Abelian composite-dimensional twisted quantum doubles. Using the physically intuitive concept of condensation, our algorithm explicitly describes how to construct the boundary and domain-wall stabilizers starting from the bulk model. This extends the utility of Pauli stabilizer models in describing non-translationally invariant topological orders with gapped boundaries. To highlight this utility, we provide a series of examples, including a new family of quantum error-correcting codes where the double of $\mathbb{Z}_4$ is coupled to instances of the double semion (DS) phase. We discuss the codes' utility in the burgeoning area of quantum error correction with an emphasis on the interplay between deconfined anyons, logical operators, error rates, and decoding. We also augment our construction, built using algorithmic tools to describe the properties of explicit stabilizer layouts at the microscopic lattice-level, with dimensional counting arguments and macroscopic-level constructions building on pants decompositions. The latter outlines how such codes' representation and design can be automated. Our results are validated by a series of error-correcting threshold calculations comparing our code's performance with standard surface codes. To do so, we introduce a composite dimensional belief propagation decoder with ordered statistics that utilizes combination sweeps. Going beyond our worked-out examples, we expect our explicit step-by-step algorithms to pave the path for new higher-dimensional codes to be discovered and implemented in near-term architectures that take advantage of various hardware's distinct strengths.

quant-ph

Towards Predictive Quantum Algorithmic Performance: Modeling Time-Correlated Noise at Scale

Combining tensor network techniques with quantum autoregressive moving average models, we quantify the effects of time-correlated noise on quantum algorithms and predict their performance at scale. As a paradigmatic test case, we examine the quantum Fourier transformation. Building on our first technical result, which shows how stochastic tensor network calculations capture frequency correlations, our second result is the revelation that infidelity exponents (scaling from diffuse, to superdiffuse) are determined by the spectral features of the noise. This numerical result rigorously quantifies the common belief that the temporal correlation scale is a key predictive feature of noise's deleterious impact on multi-qubit circuits. To highlight prospects for predicting algorithmic performance, our third result quantifies how infidelity scaling exponents -- which are fits determined by training data at moderate scales (40-80 qubits) -- can be used to predict more computationally expensive simulation at larger scales (100-128 qubits). Aside from highlighting the scalability of our methods, this workflow feeds into our last result, which is the proposal of predictive benchmarking protocols connecting simulations to experiments. Our work paves the way for large-scale algorithmic simulations and performance prediction under hardware-relevant noise conditions informed by realistic device characteristics.

quant-ph

Understanding multiscale disorder in superconducting nanowire single photon detectors

Superconducting nanowire single-photon detectors are central to applications across quantum information science. Yet, their performance is limited by the effects of disorder and electrodynamic inhomogeneities that are not well understood. By combining DC transport, dark-count measurements, and bias-dependent microwave transmission spectroscopy in the presence of controlled nanoscale disorder introduced through helium-ion irradiation, we distinguish local instability-driven processes from intrinsic superconducting depairing and kinetic inductance nonlinearities. This approach enables systematic tuning of kinetic inductance, depairing currents, microwave dissipation, and mode structure within a single device. Bias- and temperature-dependent resonance shifts quantify disorder-induced modifications of the superconducting density of states through the nonlinear kinetic inductance, while the emergence of multiple resonant modes reveals the formation of electrodynamically distinct superconducting regions. Comparing depairing under current, field, and temperature isolates the dominant microwave loss mechanisms, separating vortex, quasiparticle, and two-level-system contributions, thus providing a robust multifunctional foundation for disorder engineering of superconducting nanowire detectors and resonators.

quant-ph

Co-Designing Spectral Transformation Oracles with Hybrid Oscillator-Qubit Quantum Processors: From Algorithms to Compilation

We co-design a family of quantum eigenvalue transformation oracles that can be efficiently implemented on hybrid discrete/continuous-variable (qubit/qumode) hardware. To illustrate the oracle's representation-theoretic power and near-term experimental accessibility, we encode a Gaussian imaginary time evolution spectral filter. As a result, we define a continuous linear combination of unitaries block-encoding. Due to the ancillary qumode's infinite-dimensional nature, continuous variable qumodes constitute a powerful compilation tool for encoding continuous spectral functions without discretization errors while minimizing resource requirements. We then focus on the ubiquitous task of preparing eigenstates in quantum spin models. For completeness, we provide an end-to-end compilation which expresses high-level oracles in terms of an experimentally realizable instruction set architecture in both 1D and 2D. Finally, we examine the leading-order effects of physical errors and highlight open research directions. Our algorithms scale linearly with the spatial extent of the target system and are applicable to both near-term and large-scale quantum processors.

quant-ph

Gauge-Fixing Quantum Density Operators At Scale

We provide theory, algorithms, and simulations of non-equilibrium quantum systems using a one-dimensional (1D) completely-positive (CP), matrix-product (MP) density-operator ($ρ$) representation. By generalizing the matrix product state's orthogonality center, to additionally store positive classical mixture correlations, the MP$ρ$ factorization naturally emerges. In this work we analytically and numerically examine the virtual freedoms associated with the representation of quantum density operators. Using this augmented perspective, we simplify algorithms in certain limits to integrate the canonical form's master equation dynamics. This enables us to quickly evolve under the dynamics of two-body quantum channels without resorting to optimization-based methods. In addition to this technical advance, we also scale-up numerical examples and discuss implications for accurately modeling hardware architectures and predicting their performance. This includes an example of the quantum to classical transition of informationally leaky, i.e., decohering, qubits. In this setting, due to loss from environmental interactions, non-local complex coherence correlations are converted into global incoherent classical statistical mixture correlations. Lastly, the representation of both global and local correlations is discussed. We expect this work to have applications in additional non-equilibrium settings, beyond qubit engineering.

quant-ph

Semicoherent Symmetric Quantum Processes: Theory and Applications

Discovering pragmatic and efficient approaches to construct $\varepsilon$-approximations of quantum operators such as real (imaginary) time-evolution propagators in terms of the basic quantum operations (gates) is challenging. Prior $\varepsilon$-approximations are invaluable, in that they enable the compilation of classical and quantum algorithm modeling of, e.g., dynamical and thermodynamic quantum properties. In parallel, symmetries are powerful tools concisely describing the fundamental laws of nature; the symmetric underpinnings of physical laws have consistently provided profound insights and substantially increased predictive power. In this work, we consider the interplay between the $\varepsilon$-approximate processes and the exact symmetries in a semicoherent context -- where measurements occur at each logical clock cycle. We draw inspiration from Pascual Jordan's groundbreaking formulation of nonassociative, but commutative, symmetric algebraic form. Our symmetrized formalism is then applied in various domains such as quantum random walks, real-time evolutions, variational algorithm ansatzes, and efficient entanglement verification. Our work paves the way for a deeper understanding and greater appreciation of how symmetries can be used to control quantum dynamics in settings where coherence is a limited resource.

quant-ph

Rethinking Programming Paradigms in the QC-HPC Context

Programming for today's quantum computers is making significant strides toward modern workflows compatible with high performance computing (HPC), but fundamental challenges still remain in the integration of these vastly different technologies. Quantum computing (QC) programming languages share some common ground, as well as their emerging runtimes and algorithmic modalities. In this short paper, we explore avenues of refinement for the quantum processing unit (QPU) in the context of many-tasks management, asynchronous or otherwise, in order to understand the value it can play in linking QC with HPC. Through examples, we illustrate how its potential for scientific discovery might be realized.

quant-ph

On the Need for Extensible Quantum Compilers with Verification

In this position paper, we posit that a major Department of Energy (DOE)-funded open-source quantum compilation platform is needed to facilitate: (a) resource optimization at the fault-tolerant layer of the quantum computing software stack, and (b) co-design of that layer of the stack with other layers, and that this platform needs to be extensible and include verification.

quant-ph

Enabling Multi-threading in Heterogeneous Quantum-Classical Programming Models

In this paper, we address some of the key limitations to realizing a generic heterogeneous parallel programming model for quantum-classical heterogeneous platforms. We discuss our experience in enabling user-level multi-threading in QCOR as well as challenges that need to be addressed for programming future quantum-classical systems. Specifically, we discuss our design and implementation of introducing C++-based parallel constructs to enable 1) parallel execution of a quantum kernel with std::thread and 2) asynchronous execution with std::async. To do so, we provide a detailed overview of the current implementation of the QCOR programming model and runtime, and discuss how we add 1) thread-safety to some of its user-facing API routines, and 2) increase parallelism in QCOR by removing data races that inhibit multi-threading so as to better utilize available computing resources. We also present preliminary performance results with the Quantum++ back end on a single-node Ryzen9 3900X machine that has 12 physical cores (24 hardware threads) with 128GB of RAM. The results show that running two Bell kernels with 12 threads per kernel in parallel outperforms running the kernels one after the other each with 24 threads (1.63x improvement). In addition, we observe the same trend when running two Shor's algorthm kernels in parallel (1.22x faster than executing the kernels one after the other). Furthermore, the parallel version is better in terms of strong scalability. We believe that our design, implementation, and results will open up an opportunity not only for 1) enabling quicker prototyping of parallel/asynchrony-aware quantum-classical algorithms on quantum circuit simulators in the short-term, but also for 2) realizing a generic heterogeneous parallel programming model for quantum-classical heterogeneous platforms in the long-term.

quant-ph

Theory of the Little-Parks effect in spin-triplet superconductors

The celebrated Little-Parks effect in mesoscopic superconducting rings has recently gained great attention due to its potential to probe half-quantum vortices in spin-triplet superconductors. However, despite the large number of works reporting anomalous Little-Parks measurements attributed to unconventional superconductivity, the general signatures of spin-triplet pairing in the Little-Parks effect have not yet been systematically investigated. Here we use Ginzburg-Landau theory to study the Little-Parks effect in a spin-triplet superconducting ring that supports half-quantum vortices; we calculate the field-induced Little-Parks oscillations of both the critical temperature itself and the residual resistance resulting from thermal vortex tunneling below the critical temperature. We observe two separate critical temperatures with a single-spin superconducting state in between and find that, due to the existence of half-quantum vortices, each minimum in the upper critical temperature splits into two minima for the lower critical temperature. From a rigorous calculation of the residual resistance, we confirm that these two minima in the lower critical temperature translate into two maxima in the residual resistance below and establish the general conditions under which the two maxima can be practically resolved. In particular, we identify a fundamental trade-off between sharpening each maximum and keeping the overall magnitude of the resistance large. Our results will guide experimental efforts in designing mesoscopic ring geometries for probing half-quantum vortices in spin-triplet candidate materials on the device scale.

cond-mat.supr-con

Topological Characterization with a Twist, Condensation, and Reflection

Despite its putative robustness, the realization of and control over topological quantum matter is an ongoing grand challenge. Looking forward, robust characterization protocols are needed to first certify topological substrates before they are utilized in quantum algorithms. We contribute to this grand challenge by providing a series of experimentally accessible near- and medium-term protocols assessing the fidelity of logical processes. To do so we examine logical operators and anyonic quasiparticle excitations in twisted $\mathbb{Z}_{N=2,4}$ gauge theories. Extending the finite twist, a promising route to Ising computing in its own right, to a non-contractible twist fuses prior logical operators together and results in a twisted qubit code. The code is notable for a doubled and tripled code distance for logical $Y$ and $X$ errors respectively. Next, we review the deconfinement properties of a $\mathbb{Z}_4$ double semion condensation and provide an error correction algorithm. Based on this understanding we then present a $\mathbb{Z}_4$ topological quasiparticle reflectometry and scattering protocol. The protocol infers the topological properties of the system and serves as a high-level metric for the performance and lifetime of the interfaced topological codes. Our logical and scattering protocols are suitable for near-term devices where many physical qubits encode few logical qubits. The topological lifetime of a particle within a condensate conjugacy class, previously considered in fabricated and hetero-structured condensed-matter experiments, serves as a unifying performance metric across synthetic, qubit-based, and naturally occurring topological order.

quant-ph

Snowmass White Paper: Quantum Computing Systems and Software for High-energy Physics Research

Quantum computing offers a new paradigm for advancing high-energy physics research by enabling novel methods for representing and reasoning about fundamental quantum mechanical phenomena. Realizing these ideals will require the development of novel computational tools for modeling and simulation, detection and classification, data analysis, and forecasting of high-energy physics (HEP) experiments. While the emerging hardware, software, and applications of quantum computing are exciting opportunities, significant gaps remain in integrating such techniques into the HEP community research programs. Here we identify both the challenges and opportunities for developing quantum computing systems and software to advance HEP discovery science. We describe opportunities for the focused development of algorithms, applications, software, hardware, and infrastructure to support both practical and theoretical applications of quantum computing to HEP problems within the next 10 years.

quant-ph