arXiv subjects

Aharon Brodutch

Publications and source records attributed to Aharon Brodutch.

At least 19 recordsLinked to original sources

arXiv2026

Information gain and measurement disturbance for quantum agents

The traditional formalism of quantum measurement (hereafter ``TQM'') describes processes where some properties of quantum states are extracted and stored as classical information. While TQM is a natural and appropriate description of how humans interact with quantum systems, it is silent on the question of how a more general, quantum, agent would do so. How do we describe the observation of a system by an observer with the ability to store not only classical information but quantum states in its memory? In this paper, we extend the idea of measurement to a more general class of sensors for quantum agents which interact with a system in such a way that the agent's memory stores information (classical or quantum) about the system under study. For appropriate sensory interactions, the quantum agent may ``learn'' more about the system than would be possible under any set of classical measurements -- but as we show, this comes at the cost of additional measurement disturbance. We experimentally demonstrate such a system and characterize the tradeoffs by considering the channel capacity required to erase the effect of a measurement.

quant-ph↗

arXiv2026

Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture

We propose a fault-tolerant quantum computer architecture for trapped-ion devices, which we call the walking cat architecture. Our blueprint includes a compiler, a detailed description of all the quantum error-correction protocols, a micro-architecture, a sufficiently fast decoder, and thorough simulations. The backbone of the architecture is a cat factory, producing cat states distributed throughout the machine, which are consumed to perform logical operations. The walking cat architecture is based entirely on a modern quantum error-correction approach called low-density parity-check (LDPC) codes. We identify promising instances of the walking cat architecture, such as (1) a simple architecture based on a single LDPC code, (2) a fast architecture based on fast logical gates relying on a [[70, 6, 9]] code, equipped with Clifford-frame tracking for any 6-qubit Clifford gate, and (3) a dense architecture based on a [[102, 22, 9]]] code encoding 22 logical qubits per memory block. Our dense architecture provides a design with 110 logical qubits executing about one million T gates per day using only 2,514 physical qubits. We estimate that the quantum Hamiltonian simulation of a Heisenberg model on 100 sites can be executed within one month with 10,000 physical qubits, including all shots required to achieve chemical accuracy, suggesting that such a device could enter the regime of classically intractable physics simulations. Our design relies on hardware components that have been experimentally demonstrated on small devices. We emphasize simplicity over hypothetical performance to facilitate the practical realization of this machine. Based on this approach, we believe that a fault-tolerant quantum computer with hundreds of logical qubits capable of running millions of logical gates can be built in the near term, providing a platform to explore a broad range of applications.

quant-ph↗

arXiv2026

Pathfinding Quantum Simulations of Neutrinoless Double-Beta Decay

We present results from co-designed quantum simulations of the neutrinoless double-beta decay of a simple nucleus in 1+1D quantum chromodynamics using IonQ's Forte-generation trapped-ion quantum computers. Electrons, neutrinos, and up and down quarks are distributed across two lattice sites and mapped to 32 qubits, with an additional 4 qubits used for flag-based error mitigation. A four-fermion interaction is used to implement weak interactions, and lepton-number violation is induced by a neutrino Majorana mass. Quantum circuits that prepare the initial nucleus and time evolve with the Hamiltonian containing the strong and weak interactions are executed on IonQ Forte Enterprise. Enabled by tuned model parameters, lepton-number violation is observed in real time, providing a clear signal of neutrinoless double-beta decay. This was made possible by co-designing the simulation to maximally utilize the all-to-all connectivity and native gate-set available on IonQ's quantum computers. Quantum circuit compilation techniques and co-designed error-mitigation methods, informed from executing benchmarking circuits with up to 2,356 two-qubit gates, enabled observables to be extracted with high precision. We discuss the potential of future quantum simulations to provide yocto-second resolution of the reaction pathways in these, and other, nuclear processes.

quant-ph↗

arXiv2025

Advantage in distributed quantum computing with slow interconnects

The main bottleneck for distributed quantum computing is the rate at which entanglement is produced between quantum processing units (QPUs). In this work, we prove that multiple QPUs connected through slow interconnects can outperform a monolithic architecture made with a single QPU. We consider a distributed quantum computing model with the following assumptions: (1) each QPU is linked to only two other QPUs, (2) each link produces only one Bell pair at a time, (3) the time to generate a Bell pair is $τ_e$ times longer than the gate time. We propose a distributed version of the CliNR partial error correction scheme respecting these constraints and we show through circuit level simulations that, even if the entanglement generation time $τ_e$ is up to five times longer than the gate time, distributed CliNR can achieve simultaneously a lower logical error rate and a shorter depth than both the direct implementation and the monolithic CliNR implementation of random Clifford circuits. In the asymptotic regime, we relax assumption (2) and we prove that links producing $O(t/\ln t)$ Bell pairs in parallel, where $t$ is the number of QPUs, is sufficient to avoid stalling distributed CliNR, independently of the number of qubits per QPU. This demonstrates the potential of distributed CliNR for near-term multi-QPU devices. Moreover, we envision a distributed quantum superiority experiment based on the conjugated Clifford circuits of Bouland, Fitzsimons and Koh implemented with distributed CliNR.

quant-ph↗

arXiv2025

Recursive Clifford noise reduction

Clifford noise reduction (CliNR) is a partial error correction scheme that reduces the logical error rate of Clifford circuits at the cost of a modest qubit and gate overhead. The CliNR implementation of an $n$-qubit Clifford circuit of size $s$ achieves a vanishing logical error rate if $snp^2\rightarrow 0$ where $p$ is the physical error rate. Here, we propose a recursive version of CliNR that can reduce errors on larger circuits with a relatively small gate overhead. When $np \rightarrow 0$, the logical error rate can be vanishingly small. This implementation requires $\left(2\left\lceil \log(sp)\right\rceil+3\right)n+1$ qubits and at most $24 s \left\lceil(sp)^4\right\rceil $ gates. Using numerical simulations, we show that the recursive method can offer an advantage in a realistic near-term parameter regime. When circuit sizes are large enough, recursive CliNR can reach a lower logical error rate than the original CliNR with the same gate overhead. The results offer promise for reducing logical errors in large Clifford circuits with relatively small overheads.

quant-ph↗

arXiv2024

Improving Qubit Routing by Using Entanglement Mediated Remote Gates

Near-term quantum computers often have connectivity constraints, i.e. restrictions, on which pairs of qubits in the device can interact. Optimally mapping a quantum circuit to a hardware topology under these constraints is a difficult task. While numerous approaches have been proposed to optimize qubit routing, the resulting gate count and depth overheads of the compiled circuits remain high due to the short-range coupling of qubits in many near-term devices. Resource states, such as Bell or Einstein-Podolsky-Rosen (EPR) pairs, can be used to mediate operations that facilitate long-range interactions between qubits. In this work, we studied some of the practical trade-offs involved in using resource states for qubit routing. We developed a method that leverages an existing state-of-the-art compiler to optimize the routing of circuits with both standard gates and EPR mediated remote controlled-NOT gates. This was then used to compile different benchmark circuits for a square grid topology, where a fraction of the qubits are used to store EPR pairs. We demonstrate that EPR-mediated operations can substantially reduce the total number of gates and depths of compiled circuits when used with an appropriate optimizing compiler that accounts for practical overheads. Our results highlight the relevance of developing efficient compilation tools that can integrate EPR-mediated operations.

quant-ph↗

arXiv2024

Variable-strength non-local measurements reveal quantum violations of classical counting principles

We implement a variant of the quantum pigeonhole paradox thought experiment to study whether classical counting principles survive in the quantum domain. We observe strong measurements significantly violate the pigeonhole principle (that among three pigeons in two holes, at least one pair must be in the same hole) and the sum rule (that the number of pigeon pairs in the same hole is the sum of the number of pairs across each of the holes) in an ensemble that is pre and postselected into particular separable states. To investigate whether measurement disturbance is a viable explanation for these counter-intuitive phenomena, we employ the first ever variable-strength measurement of a non-local observable. As we decrease the measurement strength, we find the violation of the sum rule decreases, yet the pigeonhole principle remains violated. In the weak limit, the sum rule is restored due to the cancellation between two weak values with equal and opposite imaginary parts. We observe the same kind of cancellation at higher measurement strengths, thus raising the question: do strong measurements have imaginary parts?

quant-ph↗

arXiv2024

Do qubits dream of entangled sheep? Quantum measurement without classical output

Quantum mechanics is usually formulated with an implicit assumption that agents who can observe and interact with the world are external to it and have a classical memory. However, there is no accepted way to define the quantum-classical cut and no a priori reason to rule out fully quantum agents with coherent quantum memories. In this work, we introduce an entirely quantum notion of measurement, called a sensation, to account for quantum agents that experience the world through quantum sensors. Sensations eschew probabilities and instead describe a deterministic flow of quantum information. We quantify the information gain and disturbance of a sensation using concepts from quantum information theory and find that sensations always disturb at least as much as they inform. Viewing measurements as sensations could lead to a new understanding of quantum theory in general and to new results in the context of quantum networks.

quant-ph↗

arXiv2023

Experimental Communication Through Superposition of Quantum Channels

Information capacity enhancement through the coherent control of channels has attracted much attention of late, with work exploring the effect of coherent control of channel causal orders, channel superpositions, and information encoding. Coherently controlling channels necessitates a non-trivial expansion of the channel description, which for superposing qubit channels, is equivalent to expanding the channel to act on qutrits. Here we explore the nature of this capacity enhancement for the superposition of channels by comparing the maximum coherent information through depolarizing qubit channels and relevant superposed and qutrit channels. We show that the expanded qutrit channel description in itself is sufficient to explain the capacity enhancement without any use of superposition.

quant-ph↗

arXiv2023

Workflows Community Summit 2022: A Roadmap Revolution

Scientific workflows have become integral tools in broad scientific computing use cases. Science discovery is increasingly dependent on workflows to orchestrate large and complex scientific experiments that range from execution of a cloud-based data preprocessing pipeline to multi-facility instrument-to-edge-to-HPC computational workflows. Given the changing landscape of scientific computing and the evolving needs of emerging scientific applications, it is paramount that the development of novel scientific workflows and system functionalities seek to increase the efficiency, resilience, and pervasiveness of existing systems and applications. Specifically, the proliferation of machine learning/artificial intelligence (ML/AI) workflows, need for processing large scale datasets produced by instruments at the edge, intensification of near real-time data processing, support for long-term experiment campaigns, and emergence of quantum computing as an adjunct to HPC, have significantly changed the functional and operational requirements of workflow systems. Workflow systems now need to, for example, support data streams from the edge-to-cloud-to-HPC enable the management of many small-sized files, allow data reduction while ensuring high accuracy, orchestrate distributed services (workflows, instruments, data movement, provenance, publication, etc.) across computing and user facilities, among others. Further, to accelerate science, it is also necessary that these systems implement specifications/standards and APIs for seamless (horizontal and vertical) integration between systems and applications, as well as enabling the publication of workflows and their associated products according to the FAIR principles. This document reports on discussions and findings from the 2022 international edition of the Workflows Community Summit that took place on November 29 and 30, 2022.

cs.DC↗

arXiv2023

Variational Quantum Eigensolvers in the Era of Distributed Quantum Computers

The computational power of a quantum computer is limited by the number of qubits available for information processing. Increasing this number within a single device is difficult; it is widely accepted that distributed modular architectures are the solution to large scale quantum computing. The major challenge in implementing such architectures is the need to exchange quantum information between modules. In this work, we show that a distributed quantum computing architecture with {\it limited} capacity to exchange information between modules can accurately solve quantum computational problems. Using the example of a variational quantum eignesolver with an ansatz designed for a two-module (dual-core) architecture, we show that three inter-module operations provide a significant advantage over no inter-module (or serially executed) operations. These results provide a strong indication that near-term {\it modular} quantum processors can be an effective alternative to their monolithic counterparts.

quant-ph↗

arXiv2022

Preferred Interaction Ranges in Neutral-Atom Arrays in the Presence of Noise

Successful execution of a quantum information processing (QIP) task on a quantum processing device depends on the availability of high-quality entangling gates. Two important goals in the design and implementation of any entangling gate are low error rates and high connectivity. The former minimizes unintended perturbations to the quantum state during application of that gate, while the latter maximizes the set of qubits that can interact directly without remapping the QIP task through intermediary qubits -- a step that can require many additional gates. Unfortunately, these goals can sometimes conflict, necessitating a careful trade-off. In this work, we study that trade-off in two-dimensional (2D) arrays of neutral atoms interacting through two-qubit gates mediated by the Rydberg blockade effect. The connectivity associated with Rydberg mediated gates on a 2D array is limited by the strength of the Rydberg blockade shift, which decays with distance. Whereas a common strategy to improving connectivity is to use Rydberg levels with larger dipole moments, doing so also leaves the atom more susceptible to electric field noise. Here, we simulate the performance of various logical QIP operations under realistic noise sources and for a variety of Rydberg levels in order to evaluate the connectivity versus gate error trade-off. We find that under many noise regimes, a preferred range of interaction emerges that best satisfies that trade-off. While the exact optimum interaction range depends closely on the details of the atomic implementation, we present simple scaling arguments with broad applicability that should inform future hardware and compiler design choices.

quant-ph↗

arXiv2022

Quantum circuit optimization for multiple QPUs using local structure

Interconnecting clusters of qubits will be an essential element of scaling up future quantum computers. Operations between quantum processing units (QPUs) are usually significantly slower and costlier than those within a single QPU, so usage of the interconnect must be carefully managed. This is loosely analogous to the need to manage shared caches or memory in classical multi-CPU machines. Unlike classical clusters, however, quantum data is subject to the no-cloning theorem, which necessitates a rethinking of cache coherency strategies. Here, we consider a simple strategy of using EPR-mediated remote gates and teleporting qubits between clusters as necessary. Crucially, we develop optimizations at compile-time that leverage local structure in a quantum circuit, so as to minimize inter-cluster operations at runtime. We benchmark our approach against existing quantum compilation and optimization routines, and find significant improvements in circuit depth and interconnect usage.

quant-ph↗

arXiv2021

Negative quasiprobabilities enhance phase estimation in quantum-optics experiment

Operator noncommutation, a hallmark of quantum theory, limits measurement precision, according to uncertainty principles. Wielded correctly, though, noncommutation can boost precision. A recent foundational result relates a metrological advantage with negative quasiprobabilities -- quantum extensions of probabilities -- engendered by noncommuting operators. We crystallize the relationship in an equation that we prove theoretically and observe experimentally. Our proof-of-principle optical experiment features a filtering technique that we term partially postselected amplification (PPA). Using PPA, we measure a waveplate's birefringent phase. PPA amplifies, by over two orders of magnitude, the information obtained about the phase per detected photon. In principle, PPA can boost the information obtained from the average filtered photon by an arbitrarily large factor. The filter's amplification of systematic errors, we find, bounds the theoretically unlimited advantage in practice. PPA can facilitate any phase measurement and mitigates challenges that scale with trial number, such as proportional noise and detector saturation. By quantifying PPA's metrological advantage with quasiprobabilities, we reveal deep connections between quantum foundations and precision measurement.

quant-ph↗

arXiv2020

Experimental Comparison of Bohm-like Theories with Different Ontologies

The de Broglie-Bohm theory is a hidden variable interpretation of quantum mechanics which involves particles moving through space with definite trajectories. This theory singles out position as the primary ontological variable. Mathematically, it is possible to construct a similar theory where particles are moving through momentum space, and momentum is singled out as the primary ontological variable. In this paper we experimentally show how the two theories lead to different ontological descriptions. We construct the putative particle trajectories for a two-slit experiment in both the position and momentum space theories by simulating particle dynamics with coherent light. Using a method for constructing trajectories through the primary and derived (i.e. non-primary) spaces, we compare the ontological pictures offered by the two theories and show that they do not agree. This contradictory behaviour brings into question which ontology for Bohmian mechanics is to be preferred.

quant-ph↗

arXiv2020

Measuring the time atoms spend in the excited state due to a photon they don't absorb

When a resonant photon traverses a sample of absorbing atoms, how much time do atoms spend in the excited state? Does the answer depend on whether the photon is ultimately absorbed or transmitted? In particular, if it is $\textit{not}$ absorbed, does it cause atoms to spend any time in the excited state, and if so, how much? In an experiment with ultra-cold Rubidium atoms, we simultaneously record whether atoms are excited by incident ("signal") photons and whether those photons are transmitted. We measure the time spent by atoms in the excited state by using a separate, off-resonant "probe" laser to monitor the index of refraction of the sample - that is, we measure the nonlinear phase shift written by a signal pulse on this probe beam - and use direct detection to isolate the effect of single transmitted photons. For short pulses (10 ns, to be compared to the 26 ns atomic lifetime) and an optically thick medium (peak OD = 4, leading to 60% absorption given our broad bandwidth), we find that the average time atoms spend in the excited state due to one transmitted photon is not zero, but rather (77 $\pm$ 16)% of the time the average incident photon causes them to spend in the excited state. We attribute this observation of "excitation without loss" to coherent forward emission, which can arise when the instantaneous Rabi frequency (pulse envelope) picks up a phase flip - this happens naturally when a broadband pulse propagates through an optically thick medium with frequency-dependent absorption [1]. These results unambiguously reveal the complex history of photons as they propagate through an absorbing medium and illustrate the power of utilizing post-selection to experimentally investigate the past behaviour of observed quantum systems.

quant-ph↗

arXiv2019

Benchmarking quantum processors with a single qubit

The first generation of small noisy quantum processors have recently become available to non-specialists who are not required to understand specifics of the physical platforms and, in particular, the types and sources of noise. As such, it is useful to benchmark the performance of such computers against specific tasks that may be of interest to users, ideally keeping both the circuit depth and width as free parameters. Here we benchmark the IBM Quantum Experience using the Deterministic Quantum Computing with 1 qubit (DQC1) algorithm originally proposed by Knill and Laflamme in the context of liquid state NMR. In the first set of experiments we use DQC1 as a trace estimation algorithm to produce visibility plots. In the second set we use this trace estimation algorithm to distinguish between knots, a classically difficult task which is known to be complete for DQC1. Our results indicate that the main limiting factor is the length of the circuit, and that both random and systematic errors become an issue when the gate count increases. Surprisingly, we find that at the same gate count wider circuits perform better, probably due to randomization of coherent errors.

quant-ph↗

arXiv2019

Interpreting weak value amplification with a toy realist model

Constructing an ontology for quantum theory is challenging, in part due to unavoidable measurement back-action. The Aharonov-Albert-Vaidman weak measurement formalism provides a method to predict measurement results (weak values) in a regime where back-action is negligible. The weak value appears analogous to a classical conditional mean and in fact, has a number of features that further suggest it may be interpreted as being related to some underlying ontological model. However, the ontology appears bizarre since the weak values are complex and unbounded. Here, we study weak values in the context of a recent quantum optical experiment involving two-photon interactions. The results of the experiment are reinterpreted within a 'stochastic optics' model of light. The model is based on standard (Maxwell) electromagnetic theory, supplemented by stochastic fluctuations of the electromagnetic fields. We show that the conditional means of the electric field intensities correspond to the experimentally observed weak values. This is a provocative result, as it suggests that at least within this experiment, the weak value gives us information about the average of an ontological quantity (the intensity). We study the breakdown of the stochastic optics model, which occurs outside the experimentally probed regime, and in particular in the limit where the weak value predicts 'anomalous' results.

quant-ph↗