arXiv subjects

John P. T. Stenger

Publications and source records attributed to John P. T. Stenger.

At least 19 recordsLinked to original sources

arXiv2026

Scalable quantum circuit knitting using a weak-coupling approximation

We present a method for performing distributed quantum computing with controlled approximations. Exact distributed quantum computing requires exponential classical information to reconstruct the quantum process. However, we show how the classical cost is reduced to polynomial if the quantum procedure can be partitioned between a qubit that is weakly coupled the other qubits. We demonstrate our method for a layered circuit based on the circuits used for the quantum approximate optimization algorithm.

quant-ph↗

arXiv2026

Hybrid VQE-CVQE algorithm using diabatic state preparation

We propose a hybrid variational quantum algorithm that has variational parameters used by both the quantum circuit and the subsequent classical optimization. Similar to the Variational Quantum Eigensolver (VQE), this algorithm applies a parameterized unitary operator to the qubit register. We generate this operator using diabatic state preparation. The quantum measurement results then inform the classical optimization procedure used by the Cascaded Variational Quantum Eigensolver (CVQE). We demonstrate the algorithm on a system of interacting electrons and show how it can be used on long-term error-corrected as well as short-term intermediate-scale quantum computers. Our simulations performed on IBM Brisbane produced energies well within chemical accuracy.

quant-ph↗

arXiv2026

Probability Distribution Analysis of the Cascaded Variational Quantum Eigensolver

The cascaded variational quantum eigensolver (CVQE) circumvents the need for iterative communication between the quantum and classical processing units that is necessary in the conventional VQE algorithm. While CVQE offers complete freedom to choose the guiding state as input, not all guiding states suffice for solution accuracy, as well as resource efficiency. Our work presents a process based on trapezoidal-state preparation for selecting guiding states that yield accurate many-electron ground-state solutions with minimal resource consumption. By analyzing the state probability distributions at different stages of the CVQE calculations, we determine the optimal guiding-state parameters for given resource constraints. We demonstrate the process by comparing electronic energies along the minimal-energy path for a prototypical bimolecular reaction, $\mathrm{H}_2 + \mathrm{H}_2^+ \rightarrow \mathrm{H}_3^+ + \mathrm{H}$, using Noisy Intermediate-Scale Quantum (NISQ) computing.

quant-ph↗

arXiv2026

Ground-state energies of Ising models calculated using the samples from a quantum computer that simulates short-time evolution

We find the ground-state energy of the Ising model using the Cascaded Variational Quantum Eigensolver (CVQE) algorithm with the Guided-Sampling Ansatz (GSA) using up to 63 qubits on a quantum computer. We study a heavy-hex lattice to match the qubit architecture, allowing us to perform calculations in the quantum utility regime. We study both a homogeneous and random-coupling model. We locate the boundary of acceptable quantum errors as a function of the number of qubits and coupling strength. An entropic analysis is performed giving insights into the quantum computing performance. A subspace analysis is performed that suggests that the Ising model is especially suited for near-term quantum computing.

quant-ph↗

arXiv2026

Toward Quantum-Optimized Flow Scheduling in Multi-Beam Digital Satellites

Data flow scheduling for high-throughput multibeam satellites is a challenging NP-hard combinatorial optimization problem. As the problem scales, traditional methods, such as Mixed-Integer Linear Programming and heuristic schedulers, often face a trade-off between solution quality and real-time feasibility. In this paper, we present a hybrid quantum-classical framework that improves scheduling efficiency by casting Multi-Beam Time-Frequency Slot Assignment (MB-TFSA) as a Quadratic Unconstrained Binary Optimization (QUBO) problem. We incorporate the throughput-maximization objective and operational constraints into a compact QUBO via parameter rescaling to keep the formulation tractable. To address optimization challenges in variational quantum algorithms, such as barren plateaus and rugged loss landscapes, we introduce a layer-wise training strategy that gradually increases circuit depth while iteratively refining the solution. We evaluate solution quality, runtime, and robustness on quantum hardware, and benchmark against classical and hybrid baselines using realistic, simulated satellite traffic workloads.

quant-ph↗

arXiv2025

Guided sampling ansätzes for variational quantum computing

Quantum computing is a promising technology because of the ability of quantum computers to process vector spaces with dimensions that increase exponentially with the simulated system size. Extracting the solution, however, is challenging as the number of quantum gate operations and quantum circuit executions must still scale at most polynomially. Consequently, choosing a good ansatz--a polynomial subset of the exponentially many possible solutions--will be critical to maintain accuracy for larger systems. To address this challenge, we introduce a class of guided sampling ansätzes (GSAs) that depend on the system interactions and measured state samples as well as a parameter space. We demonstrate a minimal ansatz for the hydronium cation H$_3$O$^+$ and found that with only 200 circuit executions per structure on the IonQ Aria quantum computer, our calculations produced total energies around the relaxed structure with errors well below $1.59\times10^{-3}$ Ha, thus exceeding chemical accuracy.

quant-ph↗

arXiv2025

Method for simulating open-system dynamics using mid-circuit measurements on a quantum computer

We present a method for simulating the dynamics of an open electronic system on a quantum computer. This approach entails mid-circuit measurements and resets to simulate the addition or removal of electrons from the system. Our method provides a way to apply non-reversible operations to a quantum computer without the need for additional qubits. Using this method, we simulate the dynamics of an open electronic system consisting of a chain of electrons positioned between two conductive leads on the $ibm\_torino$ quantum computer. We expect the method to be generally applicable to open systems.

quant-ph↗

arXiv2025

QGeo: A Python package for calculating geodesic control functions for quantum computing

We present a new Python package that uses the established notion of geometric quantum complexity to numerically compute the difficulty associated with preparing a given unitary transformation on a quantum computer. The numerical procedure we implement is presented and discussed. Analyzed quantum circuits include: the quantum fourier transform for up to four qubits, a random circuit with depth 100, and a circuit for analyzing the evolution of a fermionic chain with several lattice sites. This package can be found for download at https://github.com/JAGDiaz/quantum-geodesics

quant-ph↗

arXiv2024

Cascaded variational quantum eigensolver algorithm

We present a cascaded variational quantum eigensolver algorithm that only requires the execution of a set of quantum circuits once rather than at every iteration during the parameter optimization process, thereby increasing the computational throughput. This algorithm uses a quantum processing unit to probe the needed probability mass functions and a classical processing unit perform the remaining calculations, including the energy minimization. The ansatz form does not restrict the Fock space and provides full control over the trial state, including the implementation of symmetry and other physically motivated constraints.

quant-ph↗

arXiv2023

Implementing Jastrow--Gutzwiller operators on a quantum computer using the cascaded variational quantum eigensolver algorithm

A Jastrow--Gutzwiller operator adds many-body correlations to a quantum state. However, the operator is non-unitary, making it difficult to implement directly on a quantum computer. We present a novel implementation of the Jastrow--Gutzwiller operator using the cascaded variational quantum eigensolver algorithm. We demonstrate the method on IBM Q Lagos for a Hubbard model.

quant-ph↗

arXiv2023

Simulating spectroscopy experiments with a superconducting quantum computer

We present a novel method for solving eigenvalue problems on a quantum computer based on spectroscopy. The method works by coupling a "probe" qubit to a set of system simulation qubits and then time evolving both the probe and the system under Hamiltonian dynamics. In this way, we simulate spectroscopy on a quantum computer. We test our method on the IBM quantum hardware for a simple single spin model and an interacting Kitaev chain model. For the Kitaev chain, we trace out the pseudo-topological phase boundary for a two-site model.

quant-ph↗

arXiv2022

Expanding variational quantum eigensolvers to larger systems by dividing the calculations between classical and quantum hardware

We present a hybrid classical/quantum algorithm for efficiently solving the eigenvalue problem of many-particle Hamiltonians on quantum computers with limited resources by splitting the workload between classical and quantum processors. This algorithm reduces the needed number of qubits at the expense of an increased number of quantum evaluations. We demonstrate the method for the Hubbard model and show how the conservation of the z-component of the total spin allows the spin-up and spin-down configurations to be computed on classical and quantum hardware, respectively. Other symmetries can be exploited in a similar manner.

quant-ph↗

arXiv2021

Integrating micromagnets and hybrid nanowires for topological quantum computing

Majorana zero modes are expected to arise in semiconductor-superconductor hybrid systems, with potential topological quantum computing applications. One limitation of this approach is the need for a relatively high external magnetic field that should also change direction at nanoscale. This proposal considers devices that incorporate micromagnets to address this challenge. We perform numerical simulations of stray magnetic fields from different micromagnet configurations, which are then used to solve for Majorana wavefunctions. Several devices are proposed, starting with the basic four-magnet design to align magnetic field with the nanowire and scaling up to nanowire T-junctions. The feasibility of the approach is assessed by performing magnetic imaging of prototype patterns.

cond-mat.mes-hall↗

arXiv2021

Triple Andreev dot chains in semiconductor nanowires

Kitaev chain is a theoretical model of a one-dimensional topological superconductor with Majorana zero modes at the two ends of the chain. With the goal of emulating this model, we build a chain of three quantum dots in a semiconductor nanowire. We observe Andreev bound states in each of the three dots and study their magnetic field and gate voltage dependence. Theory indicates that triple dot states acquire Majorana polarization when Andreev states in all three dots reach zero energy in a narrow range of magnetic field. In our device Andreev states in one of the dots reach zero energy at a lower field than in other two, placing the Majorana regime out of reach. Devices with greater uniformity or with independent control over superconductor-semiconductor coupling should can realize the Kitaev chain with high yield. Due to its overall tunability and design flexibility the quantum dot system remains promising for quantum simulation of interesting models and in particular for modular topological quantum devices.

cond-mat.mes-hall↗

arXiv2021

Simulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer

We simulate the dynamics of braiding Majorana zero modes on an IBM Quantum computer. We find the native quantum gates introduce too much noise to observe braiding. Instead, we use Qiskit Pulse to develop scaled two-qubit quantum gates that better match the unitary time evolution operator and enable us to observe braiding. This work demonstrates that quantum computers can be used for simulation, and highlights the use of pulse-level control for programming quantum computers and constitutes the first experimental evidence of braiding via dynamical Hamiltonian evolution.

quant-ph↗

arXiv2020

1D Error Correcting Code for Majorana Qubits

Although Majorana platforms are promising avenues to realizing topological quantum computing, they are still susceptible to errors from thermal noise and other sources. We show that the error rate of Majorana qubits can be drastically reduced using a 1D repetition code. The success of the code is due the imbalance between the phase error rate and the flip error rate. We demonstrate how a repetition code can be naturally constructed from segments of Majorana nanowires. We find the optimal lifetime may be extended from a millisecond to over one second.

cond-mat.mes-hall↗

arXiv2019

Weyl points in systems of multiple semiconductor-superconductor quantum dots

As an analogy to the Weyl point in k-space, we search for energy levels which close at a single point as a function of a three dimensional parameter space. Such points are topologically protected in the sense that any perturbation which acts on the two level subsystem can be corrected by tuning the control parameters. We find that parameter controlled Weyl points are ubiquitous in semiconductor-superconductor quantum dots and that they are deeply related to Majorana zero modes. In this paper, we present several semiconductor-superconductor quantum dot devices which host parameter controlled Weyl points. Further, we show how these points can be observed experimentally via conductance measurements.

cond-mat.mes-hall↗

arXiv2019

Braidonium: a braiding quantum circuit based on the $4π$ Josephson effect

We propose a topological qubit in which braiding and readout are mediated by the $4π$ Majorana-Josephson effect. The braidonium device consists of three Majorana nanowires that come together to make a tri-junction; in order to control the superconducting phase differences at the tri-junction the nanowires are enclosed in a ring made of a conventional superconductor; and in order to perform initialization/readout one of the nanowires is coupled to a fluxonium qubit through a topological Josephson junction. We analyze how flux-based control and readout protocols can be used to demonstrate braiding and qubit operation for realistic materials and circuit parameters.

cond-mat.mes-hall↗