SearcharxivSearch

arXiv subjects

Yuuki Tokunaga

Publications and source records attributed to Yuuki Tokunaga.

At least 19 recordsLinked to original sources

Quantum Federated Learning Based on Bures--Uhlmann Geometry for Heterogeneous Noisy Clients

Quantum federated learning enables collaborative model training across quantum devices without sharing raw data, and it faces the data and hardware heterogeneity inherent to noisy quantum devices. Utilizing the quantum geometric tensor is a natural remedy, yet pure-state approaches and diagonal approximations discard the correlations that encode parameter incompatibility. To address this, we extend the parameter-space geometry to the mixed states that noisy clients actually prepare. The real part of the resulting mixed-state geometric tensor is the Bures metric, which measures how fast the physical state changes under parameter variation, and the imaginary part is the mean Uhlmann curvature, which quantifies the incompatibility of estimating multiple parameters simultaneously. Accordingly, we employ the Bures metric as a local preconditioner and use the mean Uhlmann curvature to develop an achievable-precision aggregation rule that dynamically down-weights unreliable clients. Furthermore, we establish theoretical guarantees by proving a convergence theorem and a variance-dominance proposition. Empirical evaluations on a trapped-ion quantum emulator demonstrate that the proposed method maintains high accuracy across diverse device-heterogeneity conditions and outperforms standard federated averaging, whose accuracy degrades under strong noise.

quant-ph

Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice

Encoding logical qubits with surface codes and performing multi-qubit logical operations with lattice surgery is one of the most promising approaches to demonstrate fault-tolerant quantum computing. Thus, a method to efficiently schedule a sequence of lattice-surgery operations is vital for high-performance fault-tolerant quantum computing. A possible strategy to improve the throughput of lattice-surgery operations is splitting a large instruction into several small instructions, such as Bell state preparation and measurements, and executing a part of them in advance. However, scheduling methods to fully utilize this idea have yet to be explored. In this paper, we propose a fast and high-performance scheduling algorithm for lattice-surgery instructions leveraging this strategy. We achieved this by converting the scheduling problem of lattice-surgery instructions to a graph problem of embedding 3D paths into a 3D lattice, which enables us to explore efficient scheduling by solving path search problems in the 3D lattice. Based on this reduction, we propose a method to solve the path-finding problems, the look-ahead Dijkstra projection. We numerically show that this method reduced the execution time of benchmark programs generated from quantum phase estimation algorithms by 3.8 times compared with a naive method based on greedy algorithms. Our study establishes the relation between the lattice-surgery scheduling and graph search problems, which leads to further theoretical analysis on compiler optimization of fault-tolerant quantum computing.

quant-ph

Logical entanglement distribution between distant 2D array qubits

Sharing logical entangled pairs between distant quantum nodes is a key process to achieve fault tolerant quantum computation and communication. However, there is a gap between current experimental specifications and theoretical requirements for sharing logical entangled states while improving experimental techniques. Here, we propose an efficient logical entanglement distribution protocol based on surface codes for two distant 2D qubit array with nearest-neighbor interaction. A notable feature of our protocol is that it allows post-selection according to error estimations, which provides the tunability between the infidelity of logical entanglements and the success probability of the protocol. With this feature, the fidelity of encoded logical entangled states can be improved by sacrificing success rates. We numerically evaluated the performance of our protocol and the trade-off relationship, and found that our protocol enables us to prepare logical entangled states while improving fidelity in feasible experimental parameters. We also discuss a possible physical implementation using neutral atom arrays to show the feasibility of our protocol.

quant-ph

Trade-offs between Quantum and Classical Resources in the Linear Combination of Unitaries

The randomized linear combination of unitaries (LCU) method with many applications to early fault-tolerant quantum computing algorithms has been proposed. This quantum algorithm computes the same expectation values as the original, fully coherent LCU algorithm using a shallower quantum circuit with a single ancilla qubit, at the cost of a quadratically larger sampling overhead. In this work, we propose a quantum algorithm intermediate between the original and randomized LCU that manages the trade-off between the sampling overhead and circuit complexity. Our algorithm divides the set of unitary operators into several groups and then randomly samples LCU circuits from these groups to evaluate the target expectation value. Notably, we reveal that across all grouping strategies, the mechanism of the sampling overhead reduction can be solely characterized by a metric we call the reduction factor. Moreover, we analytically prove an underlying monotonicity of the reduction factor in the group size: larger group sizes entail smaller sampling overhead. Finally, our framework enables a more flexible algorithmic design by systematically yielding intermediate implementations of LCU-based algorithms; we provide intermediate implementations of non-Hermitian dynamics simulation, ground-state property estimation, and quantum error detection. Besides, we demonstrate this principle by deriving intermediate trade-off scaling in sample complexity and ancillary space for quantum linear system solver.

quant-ph

Addressing requirements for crosstalk-free quantum-gate operation in many-body nanofiber cavity QED systems

A distributed network architecture in which flying photons connect individual modules containing stationary atomic qubits is a promising approach for scaling up neutral-atom based quantum-computing platforms. We consider an all-fiber based platform consisting of nanofiber cavity QED systems interconnected via conventional optical fibers. Each nanofiber cavity is strongly coupled to multiple atoms through its evanescent field, and atom pairs within one cavity (local) or two distant cavities (remote) are addressed for performing photon-mediated quantum logic gates on them by controlling the effective light-matter coupling via local AC Stark shifts and atom-fiber distance. We numerically evaluate the required parameters for achieving nearly crosstalk-free gate operation using these targeting methods by calculating average gate fidelities, success probabilities, and Pauli error rates for both local and remote controlled-Z gates. For the case of perfect addressing, we also analytically determine the theoretical optimum gate performance as limited by cavity reflectivity, cooperativity, and qubit level-splitting.

quant-ph

Network-Based Quantum Computing: an efficient design framework for many-small-node distributed fault-tolerant quantum computing

In fault-tolerant quantum computing, a large number of physical qubits are required to construct a single logical qubit, and a single quantum node may be able to hold only a small number of logical qubits. In such a case, the idea of distributed fault-tolerant quantum computing (DFTQC) is important to demonstrate large-scale quantum computation using small-scale nodes. However, the design of distributed systems on small-scale nodes, where each node can store only one or a few logical qubits for computation, has not been explored well yet. In this paper, we propose network-based quantum computation (NBQC) to efficiently realize distributed fault-tolerant quantum computation using many small-scale nodes. A key idea of NBQC is to let computational data continuously move throughout the network while maintaining the connectivity to other nodes. We numerically show that, for practical benchmark tasks, our method achieves shorter execution times than circuit-based strategies and more node-efficient constructions than measurement-based quantum computing. Also, if we are allowed to specialize the network to the structure of quantum programs, such as peak access frequencies, the number of nodes can be significantly reduced. Thus, our methods provide a foundation in designing DFTQC architecture exploiting the redundancy of many small fault-tolerant nodes.

quant-ph

Unitary-transformed projective squeezing: applications for circuit-knitting and state-preparation of non-Gaussian states

Continuous-variable (CV) quantum computing is a promising candidate for quantum computation because it can, even with one mode, utilize infinite-dimensional Hilbert spaces and can efficiently handle continuous values. Although photonic platforms have been considered as a leading platform for CV computation, hybrid systems that use both qubits and bosonic modes, e.g., superconducting hardware, have shown significant advances because they can prepare non-Gaussian states by utilizing the nonlinear interaction between the qubits and the bosonic modes. However, the size of hybrid hardware is currently restricted. Moreover, the fidelity of the non-Gaussian state is also restricted. This work extends the projective squeezing method to establish a formalism for projecting quantum states onto the states that are unitary-transformed from the squeezed vacuum at the expense of the sampling cost. Based on this formalism, we propose methods for simulating larger quantum devices and projecting states onto the cubic phase state, a typical non-Gaussian state, with a higher squeezing level and higher nonlinearity. To make implementation practical, we can, by leveraging the interactions in hybrid systems of qubits and bosonic modes, apply the smeared projector by using either the linear-combination-of-unitaries or virtual quantum error detection algorithms. We numerically verify the performance of our methods and show that projection can suppress the effect of photon-loss errors.

quant-ph

Exploiting Translational Symmetry for Quantum Computing with Squeezed Cat Qubits

Translational symmetry plays an essential role in bosonic quantum error correction (QEC), most notably in the Gottesman-Kitaev-Preskill code. Squeezed cat (SC) codes provide a complementary platform, combining approximate protection against physical errors with the noise bias of cat codes, but a hardware-efficient route to exploit their translational symmetry for QEC has been lacking. Here we show that this symmetry provides a practical route to autonomous QEC and universal quantum computation with SC codes. We then propose a QEC protocol that autonomously restores states driven out of the code space by physical errors, even though translational symmetry along a single direction does not uniquely define the code space. Using a subsystem decomposition based on squeezed displaced Fock states, we analytically characterize the relaxation rate toward the code space induced by the protocol, thereby estimating the QEC-cycle rate required for effective error suppression. Within the same framework, we propose deterministic preparation of logical states, logical gates, and logical-$Z$ readout with improved error scaling. These results establish translational symmetry as a new perspective for approaching quantum computation with SC qubits.

quant-ph

Data-Efficient Error Mitigation for Physical and Algorithmic Errors in a Hamiltonian Simulation

Quantum dynamics simulation via Hamilton simulation algorithms is one of the most crucial applications in the quantum computing field. While this task has been relatively considered the target in the fault-tolerance era, the experiment for demonstrating utility by an IBM team simulates the dynamics of an Ising-type quantum system with the Trotter-based Hamiltonian simulation algorithm with the help of quantum error mitigation. In this study, we propose the data-efficient 1D extrapolation method to mitigate not only physical errors but also algorithmic errors of Trotterized quantum circuits in both the near-term and early fault-tolerant eras. Our proposed extrapolation method uses expectation values obtained by Trotterized circuits, where the Trotter number is selected to minimize both physical and algorithmic errors according to the circuit's physical error rate. We also propose a method that combines the data-efficient 1D extrapolation with purification QEM methods, which improves accuracy more at the expense of multiple copies of quantum states or the depth of the quantum circuit. Using the 1D transverse-field Ising model, we numerically demonstrate our proposed methods and confirm that our proposed extrapolation method suppresses both statistical and systematic errors more than the previous extrapolation method.

quant-ph

Density matrix representation of hybrid tensor networks for noisy quantum devices

The hybrid tensor network (HTN) method is a general framework allowing for the construction of an effective wavefunction with the combination of classical tensors and quantum tensors, i.e., amplitudes of quantum states. In particular, hybrid tree tensor networks (HTTNs) are very useful for simulating larger systems beyond the available size of the quantum hardware. However, while the realistic quantum states in NISQ hardware are highly likely to be noisy, this framework is formulated for pure states. In this work, as well as discussing the relevant methods, i.e., Deep VQE and entanglement forging under the framework of HTTNs, we investigate the noisy HTN states by introducing the expansion operator for providing the description of the expansion of the size of simulated quantum systems and the noise propagation. This framework enables the general tree HTN states to be explicitly represented and their physicality to be discussed. We also show that the expectation value of a measured observable exponentially vanishes with the number of contracted quantum tensors. Our work will lead to providing the noise-resilient construction of HTN states.

quant-ph

Quantum error mitigation for rotation symmetric bosonic codes with symmetry expansion

The rotation symmetric bosonic code (RSBC) is a unified framework of practical bosonic codes that have rotation symmetries, such as cat codes and binomial codes. While cat codes achieve the break-even point in which the coherence time of the encoded qubits exceeds that of unencoded qubits, with binomial codes nearly approaching that point, the state preparation fidelity needs to be still improved for practical quantum computing. Concerning this problem, we investigate the framework of symmetry expansion, a class of quantum error mitigation that virtually projects the state onto the noise-free symmetric subspace by exploiting the system's intrinsic symmetries and post-processing of measurement outcomes. Although symmetry expansion has been limited to error mitigation of quantum states immediately before measurement, we successfully generalize symmetry expansion for state preparation. To implement our method, we use an ancilla qubit and only two controlled-rotation gates via dispersive interactions between the bosonic code states and the ancilla qubit. Interestingly, this method also allows us to virtually prepare the RSBC states only from easy-to-prepare states, e.g., coherent states. We also discuss that the conventional symmetry expansion protocol can be applied to improve the computation fidelity when the symmetries of rotation bosonic codes are unavailable due to low measurement fidelity. By giving comprehensive analytical and numerical arguments regarding the trace distance between the error-mitigated state and the ideal state and the sampling cost of quantum error mitigation, we show that symmetry expansion dramatically suppresses the effect of photon loss. Our novel error mitigation method will significantly enhance computation accuracy in the near-term bosonic quantum computing paradigm.

quant-ph

Projective squeezing for translation symmetric bosonic codes

The design of translation symmetric bosonic codes, e.g., Gottesmann-Kitaev-Preskill and squeezed cat codes, is robust against photon loss, but the computation accuracy is limited by the available squeezing level. Here, we introduce the \textit{projective squeezing} (PS) method for computing outcomes for a higher squeezing level by revealing that a linear combination of displacement operators with periodic displacement values constitutes the smeared projector onto the better code space; we also show the analytical relationship between the increased squeezing level and the projection probability. We introduce concrete implementation methods for PS based on linear-combination-of-unitaries and virtual quantum error detection. We also numerically verify our analytical arguments and show that our protocol can mitigate the effect of photon loss.

quant-ph

Resource-efficient Generalized Quantum Subspace Expansion

Realizing practical quantum computing requires overcoming a number of computation errors and the limitation of device size, which have intensively been tackled by quantum error mitigation (QEM) these days. As a unified approach of noise-agnostic QEM, generalized quantum subspace expansion (GSE) has lately been proposed to be remarkably robust against stochastic and coherent errors, integrating quantum subspace expansion and virtual state purification. However, the requirement in GSE to perform entangled measurements between copies of the quantum states remains a significant drawback under the current situation of quantum devices with a restricted number of qubits and their connectivity. In this work, we propose ``Dual-GSE'', a resource-efficient implementation of GSE to circumvent this overhead by constructing an ansatz of error-mitigated quantum states via dual-state purification without state copies. Remarkably, the proposed method can further simulate larger quantum systems beyond the size of available quantum hardware, achieved by a suitable ansatz construction inspired by the divide-and-conquer strategy that classically reintroduces the effect of entanglement. While classically forging the entanglement comes with additional cost, the total sampling overhead can be notably reduced by reusing the same Pauli expectation values among divided-and-conquered subsystems. We comprehensively analyze the advantages and overhead of Dual-GSE and perform numerical simulations of the eight-qubit transverse-field Ising model under various setups. Our results demonstrate that Dual-GSE estimates the ground state energy with high accuracy under gate noise with low mitigation overhead and practical sampling cost.

quant-ph

Fault-tolerant logical state construction based on cavity-QED network

Exploring an efficient and scalable architecture of fault-tolerant quantum computing (FTQC) is vital for demonstrating useful quantum computing. Here, we propose and evaluate a scalable and practical architecture with a cavity-quantum-electrodynamics (CQED) network. Our architecture takes advantage of the stability of neutral atoms and the flexibility of a CQED network. We show a concrete framework for implementing surface codes and numerically analyze the logical error rate and threshold values beyond the simplified circuit-level noise model on several network structures. Although the requirement of CQED parameters is demanding given the current performance of experimental systems, we show that an error-decoding algorithm tailored to our proposed architecture, where the loss information of ancillary photons is utilized, greatly improves the error threshold. For example, the internal cooperativity, a good figure of merit of the cavity performance for quantum computing, required for FTQC is relaxed to 1/5 compared to the normal error-decoding for the surface code. Since our proposal and results can be extended to other LDPC codes straightforwardly, our approach will lead to achieve more reliable FTQC using CQED.

quant-ph

LSQCA: Resource-Efficient Load/Store Architecture for Limited-Scale Fault-Tolerant Quantum Computing

Current fault-tolerant quantum computer (FTQC) architectures utilize several encoding techniques to enable reliable logical operations with restricted qubit connectivity. However, such logical operations demand additional memory overhead to ensure fault tolerance. Since the main obstacle to practical quantum computing is the limited qubit count, our primary mission is to design floorplans that can reduce memory overhead without compromising computational capability. Despite extensive efforts to explore FTQC architectures, even the current state-of-the-art floorplan strategy devotes 50% of memory space to this overhead, not to data storage, to ensure unit-time random access to all logical qubits. In this paper, we propose an FTQC architecture based on a novel floorplan strategy, Load/Store Quantum Computer Architecture (LSQCA), which can achieve almost 100% memory density. The idea behind our architecture is to separate all memory regions into small computational space called Computational Registers (CR) and space-efficient memory space called Scan-Access Memory (SAM). We define an instruction set for these abstract structures and provide concrete designs named point-SAM and line-SAM architectures. With this design, we can improve the memory density by allowing variable-latency memory access while concealing the latency with other bottlenecks. We also propose optimization techniques to exploit properties of quantum programs observed in our static analysis, such as access locality in memory reference timestamps. Our numerical results indicate that LSQCA successfully leverages this idea. In a resource-restricted situation, a specific benchmark shows that we can achieve about 90% memory density with 5% increase in the execution time compared to a conventional floorplan, which achieves at most 50% memory density for unit-time random access. Our design ensures broad quantum applicability.

quant-ph

Optimal cavity design for minimizing errors in cavity-QED-based atom-photon entangling gates with finite temporal duration

We investigate atom-photon entangling gates based on cavity quantum electrodynamics (QED) for a finite photon-pulse duration, where not only the photon loss but also the temporal mode-mismatch of the photon pulse becomes a severe source of error. We analytically derive relations between cavity parameters, including transmittance, length, and effective cross-sectional area of the cavity, that minimize both the photon loss probability and the error rate due to temporal mode-mismatch by taking it into account as state-dependent pulse delay. We also investigate the effects of pulse distortion using numerical simulations for the case of short pulse duration. We believe that these analyses are the first to suggest that a cavity has an optimal length for the atom-photon gate, providing a fundamental guideline for implementing quantum information processing.

quant-ph

Gaussian-wavepacket-model for single-photon generation based on cavity QED in the adiabatic and nonadiabatic conditions

For single-photon generation based on cavity quantum electrodynamics, we investigate a practical model assuming a Gaussian wavepacket. This model makes it possible to comprehensively analyze the temporal dynamics of an atom-cavity system with both adiabatic and nonadiabatic conditions using analytical expressions. These results enable us to clarify the relationship between pulse width and maximum success probability, over the full range of coupling regimes. We demonstrate how to achieve a high success probability while keeping a short pulse width by optimizing the cavity transmittance parameter and the time-controlled exexternal field. Our formulations provide a practical tool for efficient single-photon generation in a wide variety of experimental platforms.

quant-ph

High-purity single-photon generation based on cavity QED

We propose a scheme for generating a high-purity single photon on the basis of cavity quantum electrodynamics (QED). This scheme employs a four-level system including two excited states, two ground states, and two driving lasers; this structure allows the suppression of the re-excitation process due to the atomic decay, which is known to significantly degrade the single-photon purity in state-of-the-art photon sources using a three-level system. Our analysis shows that the re-excitation probability arbitrarily approaches zero without sacrificing the photon generation probability when increasing the power of the driving laser between the excited states. This advantage is achievable by using current cavity-QED technologies. Our scheme can contribute to developing distributed quantum computation or quantum communication with high accuracy.

quant-ph