1 August 2024 in Physical Review Letters
We propose a fault-tolerant quantum computation scheme in a measurement-based manner with finite-sized entangled resource states and encoded-fusion scheme with linear optics. The encoded fusion is an entangled measurement devised to enhance the fusion success probability in the presence of losses and errors based on a quantum error-correcting code. We apply an encoded-fusion scheme, which can be performed with linear optics and active feedforwards to implement the generalized Shor code, to construct a fault-tolerant network configuration in a three-dimensional Raussendorf-Harrington-Goyal lattice based on the surface code. Numerical simulations show that our scheme allows us to achieve up to 10 times higher loss thresholds than nonencoded fusion approaches with limited numbers of photons used in fusion. Our scheme paves an efficient route toward fault-tolerant quantum computing with finite-sized entangled resource states and linear optics.
1 March 2022 in Quantum Science and Technology
Noisy linear problems have been studied in various science and engineering disciplines. A class of ‘hard’ noisy linear problems can be formulated as follows: Given a matrix and a vector b constructed using a finite set of samples, a hidden vector or structure involved in b is obtained by solving a noise-corrupted linear equation , where
η
is a noise vector that cannot be identified. For solving such a noisy linear problem, we consider a quantum algorithm based on a divide-and-conquer strategy, wherein a large core process is divided into smaller subprocesses. The algorithm appropriately reduces both the computational complexities and size of a quantum sample. More specifically, if a quantum computer can access a particular reduced form of the quantum samples, polynomial quantum-sample and time complexities are achieved in the main computation. The size of a quantum sample and its executing system can be reduced, e.g., from exponential to sub-exponential with respect to the problem length, which is better than other results we are aware. We analyse the noise model conditions for such a quantum advantage, and show when the divide-and-conquer strategy can be beneficial for quantum noisy linear problems.
21 August 2024 in Quantum Science and Technology
Variational quantum eigensolver (VQE), which combines quantum systems with classical computational power, has been arisen as a promising candidate for near-term quantum computing applications. However, the experimental resources such as the number of measurements to implement VQE rapidly increases as the Hamiltonian problem size grows. Applying entanglement measurements to reduce the number of measurement setups has been proposed to address this issue, but, entanglement measurements themselves can introduce additional resource demands. Here, we apply entanglement measurements to the photonic VQE utilizing polarization and path degrees of freedom of a single-photon. In our photonic VQE, entanglement measurements can be deterministically implemented using linear optics, so it takes full advantage of introducing entanglement measurements without additional experimental demands. Moreover, we show that such a setup can mitigate errors in measurement apparatus for a certain Hamiltonian.
23 January 2025 in Quantum Information Processing
1 October 2022 in New Journal of Physics
The noisy binary linear problem (NBLP) is known as a computationally hard problem, and therefore, it offers primitives for post-quantum cryptography. An efficient quantum NBLP algorithm that exhibits a polynomial quantum sample and time complexities has recently been proposed. However, the algorithm requires a large number of samples to be loaded in a highly entangled state and it is unclear whether such a precondition on the quantum speedup can be obtained efficiently. Here, we present a complete analysis of the quantum solvability of the NBLP by considering the entire algorithm process, namely from the preparation of the quantum sample to the main computation. By assuming that the algorithm runs on ‘fault-tolerant’ quantum circuitry, we introduce a reasonable measure of the computational time cost. The measure is defined in terms of the overall number of T gate layers, referred to as T-depth complexity. We show that the cost of solving the NBLP can be polynomial in the problem size, at the expense of an exponentially increasing logical qubits.
1 April 2025 in Quantum Science and Technology
The learner’s ability to generate a hypothesis that closely approximates the target function is crucial in machine learning. Achieving this requires sufficient data; however, unauthorized access by an eavesdropping learner can lead to security risks. Thus, it is important to ensure the performance of the ‘authorized’ learner by limiting the quality of the training data accessible to eavesdroppers. Unlike previous studies focusing on encryption or access controls, we provide a theorem to ensure superior learning outcomes exclusively for the authorized learner with quantum label encoding. In this context, we use the probably-approximately-correct learning framework and introduce the concept of learning probability to quantitatively assess learner performance. Our theorem allows the condition that, given a training dataset, an authorized learner is guaranteed to achieve a certain quality of learning outcome, while eavesdroppers are not. Notably, this condition can be constructed based only on the authorized-learning-only measurable quantities of the training data, i.e. its size and noise degree. We validate our theoretical proofs and predictions through convolutional neural networks image classification learning.