arXiv subjects

Edwin Barnes

Publications and source records attributed to Edwin Barnes.

At least 37 records · Page 2Linked to original sources

arXiv2025

Hilbert Space Fragmentation and Subspace Scar Time-Crystallinity in Driven Homogeneous Central-Spin Models

We study the stroboscopic non-equilibrium quantum dynamics of periodically kicked Hamiltonians involving homogeneous central-spin interactions. The system exhibits a strong fragmentation of Hilbert space into four-dimensional Floquet-Krylov subspaces, which oscillate between two disjointed two-dimensional subspaces and thus break the discrete time-translation symmetry of the system. Our analytical and numerical analyses reveal that fully polarized states of the satellite spins exhibit fragmentations that are stable against perturbations and have high overlap with Floquet eigenstates of atypically low bipartite entanglement entropy (scar states). Motivated by the breaking of discrete time translation symmetry by Floquet-Krylov subspaces, we introduce a novel type of time crystal that we call a ``subspace time crystal''. We present evidence of robust time-crystalline behavior in the form of a period doubling of the total magnetization of fully polarized satellite spin states that persists over long time scales. We compute non-equilibrium phase diagrams with respect to a magnetic field, coupling terms, and pulse error for various interaction types, including Heisenberg, Ising, XXZ, and XX. We also discuss possible experimental realizations of scar time crystals in color center, quantum dot, and rare-earth ion platforms.

quant-ph↗

arXiv2025

An automated geometric space curve approach for designing dynamically corrected gates

The noisy nature of quantum hardware necessitates the implementation of high-fidelity quantum gates in a noise-insensitive manner. While there exist many powerful methods for designing dynamically corrected gates, they typically involve an exploration across a large-dimensional landscape filled with solutions that are only locally optimal, making it challenging to find globally optimal ones. Moreover, these methods often use a single cost function to try to accomplish the two disparate goals of achieving a target gate and suppressing noise, and this can lead to unnecessary tradeoffs between the two and, consequently, lower fidelities. Here, we present a method for designing dynamically corrected gates called Bézier Ansatz for Robust Quantum (BARQ) control to address these challenges. Rather than numerically optimizing the controls directly, BARQ instead makes use of the Space Curve Quantum Control formalism in which the quantum evolution is mapped to a geometric space curve. In the formulation used by BARQ, the boundary conditions of the space curve determine the target gate, while its shape determines the noise robustness of the corresponding gate. This allows the target gate to be fixed upfront, so that numerical optimization is only needed to achieve noise-robustness, and this is performed efficiently using a control-point parameterization of the space curve. In this way, BARQ eliminates the gate-fixing and noise-robustness tradeoff while also providing a global perspective into the control landscape, and allows for ample freedom to design experimentally friendly and robust control pulses. The pulse design is facilitated through the developed software package qurveros.

quant-ph↗

arXiv2025

Parameterization and optimizability of pulse-level VQEs

In conventional variational quantum eigensolvers (VQEs), trial states are prepared by applying series of parameterized gates to a reference state, with the gate parameters being varied to minimize the energy of the target system. Recognizing that the gates are intermediates which are ultimately compiled into a set of control pulses to be applied to each qubit in the lab, the recently proposed ctrl-VQE algorithm takes the amplitudes, frequencies, and phases of the pulse as the variational parameters used to minimize the molecular energy. In this work, we explore how all three degrees of freedom interrelate with one another. To this end, we consider several distinct strategies to parameterize the control pulses, assessing each one through numerical simulations of a transmon-like device. For each parameterization, we contrast the pulse duration required to prepare a good ansatz, and the difficulty to optimize that ansatz from a well-defined initial state. We deduce several guiding heuristics to implement practical ctrl-VQE in hardware, which we anticipate will generalize for generic device architectures.

quant-ph↗

arXiv2024

Dynamically corrected gates in silicon singlet-triplet spin qubits

Fault-tolerant quantum computation requires low physical-qubit gate errors. Many approaches exist to reduce gate errors, including both hardware- and control-optimization strategies. Dynamically corrected gates are designed to cancel specific errors and offer the potential for high-fidelity gates, but they have yet to be implemented in singlet-triplet spin qubits in semiconductor quantum dots, due in part to the stringent control constraints in these systems. In this work, we experimentally implement dynamically corrected gates designed to mitigate hyperfine noise in a singlet-triplet qubit realized in a Si/SiGe double quantum dot. The corrected gates reduce infidelities by about a factor of three, resulting in gate fidelities above 0.99 for both identity and Hadamard gates. The gate performances depend sensitively on pulse distortions, and their specific performance reveals an unexpected distortion in our experimental setup.

quant-ph↗

arXiv2024

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with ADAPT-VQE, an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the Hessian in the state of the optimizer to better approximate the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

quant-ph↗

arXiv2024

Outcomes from a Workshop on a National Center for Quantum Education

In response to numerous programs seeking to advance quantum education and workforce development in the United States, experts from academia, industry, government, and professional societies convened for a National Science Foundation-sponsored workshop in February 2024 to explore the benefits and challenges of establishing a national center for quantum education. Broadly, such a center would foster collaboration and build the infrastructure required to develop a diverse and quantum-ready workforce. The workshop discussions centered around how a center could uniquely address gaps in public, K-12, and undergraduate quantum information science and engineering (QISE) education. Specifically, the community identified activities that, through a center, could lead to an increase in student awareness of quantum careers, boost the number of educators trained in quantum-related subjects, strengthen pathways into quantum careers, enhance the understanding of the U.S. quantum workforce, and elevate public engagement with QISE. Core proposed activities for the center include professional development for educators, coordinated curriculum development and curation, expanded access to educational laboratory equipment, robust evaluation and assessment practices, network building, and enhanced public engagement with quantum science.

physics.ed-ph↗

arXiv2024

Quantum thermalization and Floquet engineering in a spin ensemble with a clock transition

Studying and controlling quantum many-body interactions is fundamentally important for quantum science and related emerging technologies. Optically addressable solid-state spins offer a promising platform for exploring various quantum many-body phenomena due to their scalability to a large Hilbert space. However, it is often challenging to probe many-body dynamics in solid-state spin systems due to large on-site disorder and undesired coupling to the environment. Here, we investigate an optically addressable solid-state spin system comprising a strongly interacting ensemble of millions of ytterbium-171 ions in a crystal. Notably, this platform features a clock transition that gives rise to pure long-range spin-exchange interactions, termed the dipolar XY model. Leveraging this unique feature, we investigate quantum thermalization by varying the relative ratio of interaction strength to disorder, dynamically engineering the XY model into other many-body Hamiltonian models, and realizing a time-crystalline phase of matter through periodic driving. Our findings indicate that an ensemble of rare-earth ions serves as a versatile testbed for many-body physics and offers valuable insights for advancing quantum technologies.

quant-ph↗

arXiv2024

Optimization complexity and resource minimization of emitter-based photonic graph state generation protocols

Photonic graph states are important for measurement- and fusion-based quantum computing, quantum networks, and sensing. They can in principle be generated deterministically by using emitters to create the requisite entanglement. Finding ways to minimize the number of entangling gates between emitters and understanding the overall optimization complexity of such protocols is crucial for practical implementations. Here, we address these issues using graph theory concepts. We develop optimizers that minimize the number of entangling gates, reducing them by up to 75$\%$ compared to naive schemes for moderately sized random graphs. While the complexity of optimizing emitter-emitter CNOT counts is likely NP-hard, we are able to develop heuristics based on strong connections between graph transformations and the optimization of stabilizer circuits. These patterns allow us to process large graphs and still achieve a reduction of up to $66\%$ in emitter CNOTs, without relying on subtle metrics such as edge density. We find the optimal emission orderings and circuits to prepare unencoded and encoded repeater graph states of any size, achieving global minimization of emitter and CNOT resources despite the average NP-hardness of both optimization problems. We further study the locally equivalent orbit of graphs. Although enumerating orbits is $\#$P complete for arbitrary graphs, we analytically calculate the size of the orbit of repeater graphs and find a procedure to generate the orbit for any repeater size. Finally, we inspect the entangling gate cost of preparing any graph from a given orbit and show that we can achieve the same optimal CNOT count across the orbit.

quant-ph↗

arXiv2024

Minimal evolution times for fast, pulse-based state preparation in silicon spin qubits

Standing as one of the most significant barriers to reaching quantum advantage, state-preparation fidelities on noisy intermediate-scale quantum processors suffer from quantum-gate errors, which accumulate over time. A potential remedy is pulse-based state preparation. We numerically investigate the minimal evolution times (METs) attainable by optimizing (microwave and exchange) pulses on silicon hardware. We investigate two state preparation tasks. First, we consider the preparation of molecular ground states and find the METs for H$_2$, HeH$^+$, and LiH to be 2.4 ns, 4.4 ns, and 27.2 ns, respectively. Second, we consider transitions between arbitrary states and find the METs for transitions between arbitrary four-qubit states to be below 50 ns. For comparison, connecting arbitrary two-qubit states via one- and two-qubit gates on the same silicon processor requires approximately 200 ns. This comparison indicates that pulse-based state preparation is likely to utilize the coherence times of silicon hardware more efficiently than gate-based state preparation. Finally, we quantify the effect of silicon device parameters on the MET. We show that increasing the maximal exchange amplitude from 10 MHz to 1 GHz accelerates the METs, e.g., for H$_2$ from 84.3 ns to 2.4 ns. This demonstrates the importance of fast exchange. We also show that increasing the maximal amplitude of the microwave drive from 884 kHz to 56.6 MHz shortens state transitions, e.g., for two-qubit states from 1000 ns to 25 ns. Our results bound both the state-preparation times for general quantum algorithms and the execution times of variational quantum algorithms with silicon spin qubits.

quant-ph↗

arXiv2024

Ballast charges for semiconductor spin qubits

Semiconductor spin qubits are an attractive platform for quantum computing, but their performance is degraded primarily by fluctuating electromagnetic environments. We introduce the concept of ballast charges, which are induced charges on the surface of an additional screening layer situated below the qubits. The counteractive behavior of these charges can significantly reduce the power spectral density associated with fluctuations from two-level systems that contribute to charge noise. Our simulations show that the dephasing time of a spin qubit in a Si/SiGe device increases by a factor of 4 to 6 on average when using this method. We also discuss the physical implementation and potential challenges of this approach.

cond-mat.mes-hall↗

arXiv2024

High-throughput assessment of defect-nuclear spin register controllability for quantum memory applications

Quantum memories play a key role in facilitating tasks within quantum networks and quantum information processing, including secure communications, advanced quantum sensing, and distributed quantum computing. Progress in characterizing large nuclear spin registers coupled to defect electronic spins has been significant, but selecting memory qubits remains challenging due to the multitude of possible assignments. Numerical simulations for evaluating entangling gate fidelities encounter obstacles, restricting research to small registers, while experimental investigations are time-consuming and often limited to well-understood samples. Here we present an efficient methodology for systematically assessing the controllability of defect systems coupled to nuclear spin registers. We showcase the approach by investigating the generation of entanglement links between defects in SiC and randomly selected sets of nuclear spins within the two-species ($^{13}$C and $^{29}$Si) nuclear register. We quantify the performance of entangling gate operations and present the achievable gate fidelities, considering both the size of the register and the presence of unwanted nuclear spins. We find that some control sequences perform better than others depending on the number of target versus bath nuclei. This efficient approach is a guide for both experimental investigation and engineering, facilitating the high-throughput exploration of suitable defect systems for quantum memories.

quant-ph↗

arXiv2024

Generation of genuine all-way entanglement in defect-nuclear spin systems through dynamical decoupling sequences

Multipartite entangled states are an essential resource for sensing, quantum error correction, and cryptography. Color centers in solids are one of the leading platforms for quantum networking due to the availability of a nuclear spin memory that can be entangled with the optically active electronic spin through dynamical decoupling sequences. Creating electron-nuclear entangled states in these systems is a difficult task as the always-on hyperfine interactions prohibit complete isolation of the target dynamics from the unwanted spin bath. While this emergent cross-talk can be alleviated by prolonging the entanglement generation, the gate durations quickly exceed coherence times. Here we show how to prepare high-quality GHZ$_M$-like states with minimal cross-talk. We introduce the $M$-tangling power of an evolution operator, which allows us to verify genuine all-way correlations. Using experimentally measured hyperfine parameters of an NV center spin in diamond coupled to carbon-13 lattice spins, we show how to use sequential or single-shot entangling operations to prepare GHZ$_M$-like states of up to $M=10$ qubits within time constraints that saturate bounds on $M$-way correlations. We study the entanglement of mixed electron-nuclear states and develop a non-unitary $M$-tangling power which additionally captures correlations arising from all unwanted nuclear spins. We further derive a non-unitary $M$-tangling power which incorporates the impact of electronic dephasing errors on the $M$-way correlations. Finally, we inspect the performance of our protocols in the presence of experimentally reported pulse errors, finding that XY decoupling sequences can lead to high-fidelity GHZ state preparation.

quant-ph↗

arXiv2024

Deterministic generation of qudit photonic graph states from quantum emitters

We propose and analyze deterministic protocols to generate qudit photonic graph states from quantum emitters. We show that our approach can be applied to generate any qudit graph state, and we exemplify it by constructing protocols to generate one- and two-dimensional qudit cluster states, absolutely maximally entangled states, and logical states of quantum error correcting codes. Some of these protocols make use of time-delayed feedback, while others do not. The only additional resource requirement compared to the qubit case is the ability to control multi-level emitters. These results significantly broaden the range of multi-photon entangled states that can be produced deterministically from quantum emitters.

quant-ph↗

arXiv2023

Scaling adaptive quantum simulation algorithms via operator pool tiling

Adaptive variational quantum simulation algorithms use information from the quantum computer to dynamically create optimal trial wavefunctions for a given problem Hamiltonian. A key ingredient in these algorithms is a predefined operator pool from which trial wavefunctions are constructed. Finding suitable pools is critical for the efficiency of the algorithm as the problem size increases. Here, we present a technique called operator pool tiling that facilitates the construction of problem-tailored pools for arbitrarily large problem instances. By first performing an ADAPT-VQE calculation on a smaller instance of the problem using a large, but computationally inefficient operator pool, we extract the most relevant operators and use them to design more efficient pools for larger instances. We demonstrate the method here on strongly correlated quantum spin models in one and two dimensions, finding that ADAPT automatically finds a highly effective ansatz for these systems. Given that many problems, such as those arising in condensed matter physics, have a naturally repeating lattice structure, we expect the pool tiling method to be a widely applicable technique apt for such systems.

quant-ph↗

arXiv2023

ADAPT-QAOA with a classically inspired initial state

Quantum computing may provide advantage in solving classical optimization problems. One promising algorithm is the quantum approximate optimization algorithm (QAOA). There have been many proposals for improving this algorithm, such as using an initial state informed by classical approximation solutions. A variation of QAOA called ADAPT-QAOA constructs the ansatz dynamically and can speed up convergence. However, it faces the challenge of frequently converging to excited states which correspond to local minima in the energy landscape, limiting its performance. In this work, we propose to start ADAPT-QAOA with an initial state inspired by a classical approximation algorithm. Through numerical simulations we show that this new algorithm can reach the same accuracy with fewer layers than the standard QAOA and the original ADAPT-QAOA. It also appears to be less prone to the problem of converging to excited states.

quant-ph↗

arXiv2023

Time-crystalline behavior in central-spin models with Heisenberg interactions

Time-crystalline behavior has been predicted and observed in quantum central-spin systems with periodic driving and Ising interactions. Here, we theoretically show that it can also arise in central-spin systems with Heisenberg interactions. We present two methods to achieve this: application of a sufficiently large Zeeman splitting on the central spin compared to the satellite spins, or else by applying additional pulses to the central spin every Floquet period. In both cases, we show that the system exhibits a subharmonic response in spin magnetizations in the presence of disorder for both pure Heisenberg and XXZ interactions. Our results pertain to any XXZ central-spin system, including hyperfine-coupled electron-nuclear systems in quantum dots or color centers.

quant-ph↗

arXiv2023

Protocol for nearly deterministic parity projection on two photonic qubits

Photonic parity projection plays a significant role in photonic quantum information processing. Non-destructive parity projections normally require high-fidelity Controlled-Z gates between photonic and matter qubits, which can be experimentally demanding. In this paper, we propose a nearly deterministic parity projection protocol on two photonic qubits which only requires stable matter-photon Controlled-Phase gates. The fact that our protocol does not require perfect Controlled-Z gates makes it more amenable to experimental implementation.

quant-ph↗

arXiv2023

Long-distance photon-mediated and short-distance entangling gates in three-qubit quantum dot spin systems

Superconducting microwave resonator couplers will likely become an essential component in modular semiconductor quantum dot (QD) spin qubit processors, as they help alleviate cross-talk and wiring issues as the number of qubits increases. Here, we focus on a three-qubit system composed of two modules: a two-electron triple QD resonator-coupled to a single-electron double QD. Using a combination of analytical techniques and numerical results, we derive an effective Hamiltonian that describes the three-qubit logical subspace and show that it accurately captures the dynamics of the system. We examine the performance of short-range and long-range entangling gates, revealing the effect of a spectator qubit in reducing the gate fidelities in both cases. We further study the competition between non-adiabatic errors and spectator-associated errors in short-range operations and quantify their relative importance across practical parameter ranges for short and long gate times. We also analyze the impact of charge noise together with residual coupling to the spectator qubit on inter-module entangling gates and find that for current experimental settings, leakage errors are the main source of infidelities in these operations. Our results help pave the way toward identifying optimal modular QD architectures for quantum information processing on semiconductor chips.

quant-ph↗