SearcharxivSearch

arXiv subjects

Yotam Shapira

Publications and source records attributed to Yotam Shapira.

At least 19 recordsLinked to original sources

Solving wave propagation problems via geometric quantum state preparation on dispersion manifolds

We present a quantum algorithm for solving partial differential equations through a linear-system formulation, focusing on wave propagation problems described by the discretized Helmholtz equation in frequency domain. Although quantum linear-system solvers offer exponential compression of the system degrees of freedom, their runtime complexity is generally governed by the condition number of the discretized operator. Exploiting the analytic structure of the differential operator can provide an alternative to explicit matrix inversion, as illustrated for the screened Poisson equation through an explicit quantum circuit. For the Helmholtz equation, however, the inverse operator becomes singular on the dispersion surface $k^2=ω^2/c^2$, rendering direct Fourier-space state-preparation methods exponentially inefficient. We address this challenge by directly preparing quantum states supported on the resonant manifold and encoding source locations through Fourier phases. The resulting algorithm eliminates the exponentially large overhead associated with post-selection on the resonant manifold, yielding a success probability that depends linearly on the number of sources and is independent of the computational domain size. More generally, our approach applies to hyperbolic differential equations whose Fourier-space solutions possess singular support on dispersion manifolds, recasting their solution as a problem of geometric quantum state preparation.

quant-ph

Optimizing resource bounds in direct fidelity estimation

Direct fidelity estimation provides a way to estimate the fidelity between an experimentally prepared state and a desired pure target state without performing full tomography. Two influential formulations were introduced in 2011 by Flammia and Liu and by da Silva, Landon-Cardinal, and Poulin. In these protocols, the total estimation error is controlled through two distinct probabilistic steps: first, the fidelity is approximated using randomly sampled Pauli observables; second, each sampled expectation value is estimated from finitely many measurement outcomes. In this work we show that additional structural information about the noise can substantially sharpen the corresponding resource bounds. In particular, for some canonical channels the effective number of sampled Pauli settings can be reduced, leading to lower measurement cost both in the general pure-state setting and in the case of a stabilizer state. These results illustrate a broader point: worst-case confidence bounds in direct fidelity estimation can be significantly conservative when experimentally relevant structure is ignored. As a technical ingredient, we also revisit the allocation of the total accuracy and confidence budgets between the two probabilistic steps. Reformulating the analysis in terms of separate error parameters yields a constrained optimization problem whose solution lowers the average number of measurements in the general pure-state setting. Numerical simulations based on quantum circuits implemented in Qiskit illustrate both the improvement obtained under structured-noise assumptions and the conservativeness of the original worst-case bounds.

quant-ph

Trapped-Ion Multiqubit Gates are Compatible with Scalable Quantum Error Correction

We construct a detailed microscopic noise model for multi-qubit (MQ) gate operations in the context of trapped ion architecture with all-to-all connectivity. We find that phonon heating and motional dephasing are well captured by effective single- and two-qubit error channels that can, in principle, act between arbitrary pairs of qubits. Nevertheless, the median magnitude of two-qubit errors between uncoupled qubits is substantially smaller than that of errors between gate-coupled qubits. Errors associated with photon scattering are shown to solely propagate to qubits participating in gate operations. Lastly, we combine all noise sources, assigned with experimentally relevant parameters, and explore the scalability of a quantum error correction (QEC) scheme based on the rotated surface code, as a function of error rates and code size. Our analysis bridges device-level physics and QEC performance for MQ gates in trapped-ion architectures.

quant-ph

Digital Predistortion of Optical Fields for Fast and High-Fidelity Entangling Gates in Trapped-Ion Qubits

High-fidelity quantum gates require precise classical control signals, yet the analog hardware delivering these signals introduces nonlinear distortions that degrade gate performance. We demonstrate digital predistortion of an acousto-optic modulator used to generate multi-tone entangling-gate waveforms in a trapped-ion processor based on $^{88}$Sr$^+$. By measuring and inverting the static nonlinear amplitude response of the modulator, we apply a feed-forward correction that extends its linear operating range and suppresses spurious intermodulation products. Spectral analysis of the gate beam shows 3--5 dB suppression of the dominant intermodulation tones, approximately doubling the usable diffraction efficiency at a $10^{-3}$ estimated gate-error threshold. Direct two-qubit Bell-state fidelity measurements confirm that predistortion consistently improves entangling-gate performance. The calibrate-and-invert methodology is device and platform agnostic, applicable to any nonlinear element in the classical control chain of a quantum processor.

quant-ph

Fast design and scaling of multi-qubit gates in large-scale trapped-ion quantum computers

Quantum computers based on crystals of trapped ions are a prominent technology for quantum computation. A unique feature of trapped ions is their long-range Coulomb interactions, which can be exploited to realize large-scale multiqubit entanglement gates. However, scaling up the number of qubits, $N$, in these systems, while retaining high-fidelity and high-speed operations, is challenging. Specifically, designing multiqubit entanglement gates in long ion crystals of hundreds of ions involves an NP-hard optimization problem, rendering scale-up not only a technological challenge, but also a conceptual challenge. Here we introduce a method that mitigates this challenge, effectively allowing for a polynomial-time design of fast, robust, and programmable entanglement gates, acting on the entire ion-crystal. We show that while the number of simultaneous entanglement operations scales as $N^2$, the gate duration scales as $N$, leading to a scaling advantage. We use our methods to investigate the drive-power requirements and susceptibility to noise and errors of these multiqubit gates. Our method delineates a path towards scaling up quantum computers based on ion-crystals with hundreds of qubits.

quant-ph

Optimal constant-cost implementations of Clifford operations using global interactions

We investigate quantum circuits built from arbitrary single-qubit operations combined with programmable all-to-all multiqubit entangling gates that are native to, among other systems, trapped-ion quantum computing platforms. We report a constant-cost of no more than four applications of such Clifford entangling multiqubit gates to realize any sequence of Clifford operations of any length, without ancillae, which is the theoretically optimal gate count cost. We do this by implementing any sequence of CNOT gates of any length with four applications of such gates, without ancillae, and show that the extension to general Clifford operations incurs no additional cost. We investigate the required qubit drive power that is associated with our implementation and show that it is lower than that of a standard approach. Our work introduces a practical and computationally efficient algorithm to realize these compilations.

quant-ph

Phase gadget compilation of quantum circuits using multiqubit gates

Quantum circuit synthesis and compilation are critical components in the quantum computing stack, both for contemporary quantum systems, where efficient use of limited resources is essential, as well as for large-scale fault-tolerant platforms, where computation time can be minimized. The specific characteristics of the quantum hardware determine which circuit designs and optimizations are feasible. We present a phase-gadget based method for compilation of quantum circuits using programmable multiqubit entangling gates, that are native, among others, to trapped-ions quantum computers. We use phase-gadgets in order to generically reduce circuit depths and efficiently implement them with few, high-fidelity, multiqubit gates. We test our methods on a large set of benchmark circuits and demonstrate generic circuit depth reduction and implementation error reduction.

quant-ph

Reduced constant-cost implementations of Clifford operations using global interactions

We investigate quantum circuits built from arbitrary single-qubit operations combined with programmable all-to-all multiqubit entangling gates that are native to, among other systems, trapped-ion quantum computing platforms. We report a constant-cost of no more than 6 application of such Clifford entangling multiqubit gates to realize any sequence of Clifford operations of any length, without ancillae. Furthermore, we show that any sequence of CNOT gates of any length, can be replaced with 5 applications of such Clifford entangling multiqubit gates, without ancillae. We investigate the required qubit drive power that is associated with these implementations. Our work introduces a practical and computationally efficient algorithm to realize these compilations.

quant-ph

Full programmable quantum computing with trapped-ions using semi-global fields

Trapped-ion quantum computing can utilize all motional modes of the ion-crystal, to entangle multiple qubits simultaneously, enabling universal computation with multi-qubit gates supplemented by single-qubit rotations. Using multiple tones to drive each ion individually induces Ising-type interactions, forming a multi-qubit gate, where the coupling matrix of all ion pairs is fully controllable. This reduces the total gate count while maintaining high fidelity, as opposed to traditional methods that rely on a single type of two-qubit gate, such as the well-known Mølmer-Sørensen gate. However, scaling to large ion chains, individual addressing can be technically challenging in terms of optical delivery and signal generation. We explore global and semi-global drives combined with single-qubit flips and show that these can reproduce the full set of multi-qubit gates. Although optimizing the combination of single-qubit flips is a computationally hard problem, we propose an efficient scheme to implement any desired couplings in large ion chains, yielding a concatenation scheme that uses at most $N/2$ multi-qubit gates, with $N$ being the number of ions. In addition, we show that by using $B<N$ independent semi-global fields, each driving a set of $N/B$ ions, the number of maximal multi-qubit gates is reduced to approximately $\frac{N^2}{B^2 (N-1)}$. We show how to design the driving fields that support these schemes and investigate their properties. Our results pave the way for efficient implementations of quantum algorithms in large-scale trapped-ion quantum systems.

quant-ph

Optical tweezer-controlled entanglement gates with trapped ion qubits

We propose an entanglement protocol where ions illuminated by optical tweezers serve as control qubits. We experimentally demonstrate this proposal with a controlled M$ø$lmer-S$ø$rensen operation on a three-ion chain, analogous to the canonical Toffoli gate. Our demonstration features cases in which the control qubit was in one of its logical basis states, and not in their superposition, due to dephasing by tweezer beam intensity fluctuations. Finally, we discuss how our protocol generalizes to a broad class of unitary operations and larger qubit systems, enabling a single-pulse implementation of $n$-controlled unitaries.

quant-ph

Efficient compilation of quantum circuits using multi-qubit gates

As quantum processors grow in scale and reliability, the need for efficient quantum gate decomposition of circuits to a set of specific available gates, becomes ever more critical. The decomposition of a particular algorithm into a sequence of these available gates is not unique. Thus, the fidelity of an algorithm's implementation can be increased by choosing an optimized decomposition. This is true both for noisy intermediate-scale quantum platforms as well as for implementation of quantum error correction schemes. Here we present a compilation scheme which implements a general-circuit decomposition to a sequence of Ising-type, long-range, multi-qubit entangling gates, that are separated by layers of single qubit rotations. We use trapped ions as an example in which multi-qubit gates naturally arise, yet any system that has connectivity beyond nearest-neighbors may gain from our approach. We evaluate our methods using the quantum volume test over $N$ qubits. In this context, our method replaces $3N^2/2$ two-qubit gates with $2N+1$ multi-qubit gates. Furthermore, our method minimizes the magnitude of the entanglement phases, which typically enables an improved implementation fidelity, by using weaker driving fields or faster realizations. We numerically test our compilation and show that, compared to conventional realizations with sequential two-qubit gates, our compilations improves the logarithm of quantum volume by $20\%$ to $25\%$.

quant-ph

Programmable quantum simulations on a trapped-ions quantum simulator with a global drive

Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in carrying out accurate simulations over long evolution times. Here we experimentally demonstrate a method for quantum simulations on a small-scale trapped ions-based quantum simulator. Our method enables quantum simulations of programmable spin-Hamiltonians, using only simple global fields, driving all qubits homogeneously and simultaneously. We measure the evolution of a quantum Ising ring and accurately reconstruct the Hamiltonian parameters, showcasing an accurate and high-fidelity simulation. Our method enables a significant reduction in the required control and depth of quantum simulations, thus generating longer evolution times with higher accuracy.

quant-ph

Scalable architecture for trapped-ion quantum computing using RF traps and dynamic optical potentials

Qubits based on ions trapped in linear radio-frequency traps form a successful platform for quantum computing, due to their high fidelity of operations, all-to-all connectivity and degree of local control. In principle there is no fundamental limit to the number of ion-based qubits that can be confined in a single 1D register. However, in practice there are two main issues associated with long trapped-ion crystals, that stem from the 'softening' of their modes of motion, upon scaling up: high heating rates of the ions' motion, and a dense motional spectrum; both impede the performance of high-fidelity qubit operations. Here we propose a holistic, scalable architecture for quantum computing with large ion-crystals that overcomes these issues. Our method relies on dynamically-operated optical potentials, that instantaneously segment the ion-crystal into cells of a manageable size. We show that these cells behave as nearly independent quantum registers, allowing for parallel entangling gates on all cells. The ability to reconfigure the optical potentials guarantees connectivity across the full ion-crystal, and also enables efficient mid-circuit measurements. We study the implementation of large-scale parallel multi-qubit entangling gates that operate simultaneously on all cells, and present a protocol to compensate for crosstalk errors, enabling full-scale usage of an extensively large register. We illustrate that this architecture is advantageous both for fault-tolerant digital quantum computation and for analog quantum simulations.

quant-ph

The inverse Mpemba effect demonstrated on a single trapped ion qubit

The Mpemba effect is a counter-intuitive phenomena in which a hot system reaches a cold temperature faster than a colder system, under otherwise identical conditions. Here we propose a quantum analog of the Mpemba effect, on the simplest quantum system, a qubit. Specifically, we show it exhibits an inverse effect, in which a cold qubit reaches a hot temperature faster than a hot qubit. Furthermore, in our system a cold qubit can heat up exponentially faster, manifesting the strong version of the effect. This occurs only for sufficiently coherent systems, making this effect quantum mechanical, i.e. due to interference effects. We experimentally demonstrate our findings on a single $^{88}\text{Sr}^+$ trapped ion qubit. The existence of this anomalous relaxation effect in simple quantum systems reveals its fundamentality, and may have a role in designing and operating quantum information processing devices.

quant-ph

Anyon statistics through conductance measurements of time-domain interferometry

We propose a method to extract the mutual exchange statistics of the anyonic excitations of a general Abelian fractional quantum Hall state, by comparing the tunneling characteristics of a quantum point contact in two different experimental conditions. In the first, the tunneling current between two edges at different chemical potentials is measured. In the second, one of these edges is strongly diluted by an earlier point contact. We describe the case of the dilute beam in terms of a time-domain interferometer between the anyons flowing along the edge and quasiparticle-quasihole excitations created at the tunneling quantum point contact. In both cases, temperature is kept large, such that the measured current is given to linear response. Remarkably, our proposal does not require the measurement of current correlations, and allows us to carefully separate effects of the fractional charge and statistics from effects of intra- and inter-edge interactions.

cond-mat.mes-hall

Robust two-qubit trapped ions gates using spin-dependent squeezing

Entangling gates are an essential component of quantum computers. However, generating high-fidelity gates, in a scalable manner, remains a major challenge in all quantum information processing platforms. Accordingly, improving the fidelity and robustness of these gates has been a research focus in recent years. In trapped ions quantum computers, entangling gates are performed by driving the normal modes of motion of the ion chain, generating a spin-dependent force. Even though there has been significant progress in increasing the robustness and modularity of these gates, they are still sensitive to noise in the intensity of the driving field. Here we supplement the conventional spin-dependent displacement with spin-dependent squeezing, which enables a gate that is robust to deviations in the amplitude of the driving field. We solve the general Hamiltonian and engineer its spectrum analytically. We also endow our gate with other, more conventional, robustness properties, making it resilient to many practical sources of noise and inaccuracies.

quant-ph

Quantum simulations of interacting systems with broken time-reversal symmetry

Many-body systems of quantum interacting particles in which time-reversal symmetry is broken give rise to a variety of rich collective behaviors, and are therefore a major target of research in modern physics. Quantum simulators can potentially be used to explore and understand such systems, which are often beyond the computational reach of classical simulation. Of these, platforms with universal quantum control can experimentally access a wide range of physical properties. However, simultaneously achieving strong programmable interactions, strong time-reversal symmetry breaking, and high fidelity quantum control in a scalable manner is challenging. Here we realized quantum simulations of interacting, time-reversal broken quantum systems in a universal trapped-ion quantum processor. Using a scalable scheme that was recently proposed we implemented time-reversal breaking synthetic gauge fields, shown for the first time in a trapped ion chain, along with unique coupling geometries, potentially extendable to simulation of multi dimensional systems. Our high fidelity single-site resolution in control and measurement, along with highly programmable interactions, allow us to perform full state tomography of a ground state showcasing persistent current, and to observe dynamics of a time-reversal broken system with nontrivial interactions. Our results open a path towards simulation of time-reversal broken many-body systems with a wide range of features and coupling geometries.

quant-ph

Comparing Two-Qubit and Multi-Qubit Gates within the Toric Code

In some quantum computing (QC) architectures, entanglement of an arbitrary number of qubits can be generated in a single operation. This property has many potential applications, and may specifically be useful for quantum error correction (QEC). Stabilizer measurements can then be implemented using a single multi-qubit gate instead of several two-qubit gates, thus reducing circuit depth. In this study, the toric code is used as a benchmark to compare the performance of two-qubit and five-qubit gates within parity-check circuits. We consider trapped ion qubits that are controlled via Raman transitions, where the primary source of error is assumed to be spontaneous photon scattering. We show that a five-qubit Mølmer-Sørensen gate offers an approximately $40\%$ improvement over two-qubit gates in terms of the fault tolerance threshold. This result indicates an advantage of using multi-qubit gates in the context of QEC.

quant-ph