arXiv subjects

Akira Sone

Publications and source records attributed to Akira Sone.

At least 19 recordsLinked to original sources

arXiv2026

Demonstrating Quadratic Monte Carlo Speedup via Quantum Amplitude Estimation: Nuclear Engineering Examples

We demonstrate quantum amplitude estimation (QAE) as a route to quadratic speedup for Monte Carlo-type expectation values in nuclear engineering. Using QPE-based QAE, we study two examples: a discrete fission-neutron-yield expectation and a U-238 resonance integral under a $1/E$ slowing-down spectrum. The toy problem is implemented as a gate-level Qiskit circuit, while the resonance-integral example is simulated through an exact eigendecomposition of the Grover operator to avoid state-preparation decomposition bottlenecks. In both cases, the squared error scales as $O(1/T^2)$ with the number of oracle calls $T$, compared with the classical Monte Carlo scaling $O(1/N)$. For the U-238 example, QAE recovers the resonance integral to approximately $0.03%$ relative error with $m=14$ phase-estimation qubits.

quant-ph↗

arXiv2025

Information Processing in Quantum Thermodynamic Systems: an Autonomous Hamiltonian Approach

Extending the quantum formulation of [Phys. Rev. X 3, 041003 (2013)] to a more general setting for studying the thermodynamics of information processing including initial correlations, we generalize the second law of thermodynamics to account for information processing in such autonomous systems. We consider a composite quantum system consisting of a principal system, heat bath, memory, and work source, and adopt an autonomous Hamiltonian framework. We derive constraints on the total Hamiltonian that ensure the work source to act as a catalyst preserving its original randomness, namely that the total unitary evolution must have a unitary partial transpose. We show that this requirement is equivalent to the commutativity of operators acting on the joint system of the principal system, bath, and memory, which underlies the Hamiltonian structure. Next, we generalize the quantum speed limit for the joint dynamics of system and memory to the quantum thermodynamic speed limit, from which we obtain a dynamical version of Landauer's bound. More importantly, we also interpret this quantum thermodynamic speed limit in the context of quantum hypothesis testing.

quant-ph↗

arXiv2025

Harnessing Intrinsic Noise for Quantum Simulation of Open Quantum Systems

Simulating open quantum systems on quantum computers presents a fundamental challenge: open quantum dynamics are intrinsically nonunitary, whereas quantum computers operate through unitary evolution. Conventional approaches overcome this mismatch by encoding nonunitary processes into unitary circuits, but such methods incur substantial overhead in both qubits and gates. Here, we propose an alternative perspective. Quantum processors are themselves open systems, inherently subject to noise. Instead of correcting all errors and then encoding nonunitary dynamics with unitary logical qubits and gates, we show how noise can be harnessed as a computational resource. We develop a noise-assisted quantum algorithm that selectively preserves physical noise to emulate nonunitary channels, enabling efficient simulation of open quantum dynamics with minimal qubit requirements. Our approach applies both to noisy intermediate-scale quantum (NISQ) devices and future fault-tolerant architectures. By leveraging intrinsic noise, this method circumvents the need to encode nonunitary dynamics into unitary gates and relaxes fidelity requirements on physical qubits, thereby reducing the overhead of quantum error correction. This framework reframes noise from a limitation into a resource, opening new directions for practical quantum simulation of open systems

quant-ph↗

arXiv2025

No-go theorem for environment-assisted invariance in non-unitary dynamics

We elucidate the requirements for quantum operations that achieve environment-assisted invariance (envariance), a symmetry of entanglement. While envariance has traditionally been studied within the framework of local unitary operations, we extend the analysis to consider non-unitary local operations. First, we investigate the conditions imposed on operators acting on pure bipartite entanglement to attain envariance. We show that the local operations must take a direct-sum form in their Kraus operator representations, establishing decoherence-free subspaces. Furthermore, we prove that this also holds for the multipartite scenario. As an immediate consequence, we demonstrate that environment-assisted shortcuts to adiabaticity cannot be achieved through non-unitary operations. In addition, we show that the static condition of the eternal black hole in AdS/CFT is violated when the CFTs are coupled to the external baths.

quant-ph↗

arXiv2024

Noise-Induced Barren Plateaus in Variational Quantum Algorithms

Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise on NISQ devices places fundamental limitations on VQA performance. We rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau (i.e., vanishing gradient). Specifically, for the local Pauli noise considered, we prove that the gradient vanishes exponentially in the number of qubits $n$ if the depth of the ansatz grows linearly with $n$. These noise-induced barren plateaus (NIBPs) are conceptually different from noise-free barren plateaus, which are linked to random parameter initialization. Our result is formulated for a generic ansatz that includes as special cases the Quantum Alternating Operator Ansatz and the Unitary Coupled Cluster Ansatz, among others. For the former, our numerical heuristics demonstrate the NIBP phenomenon for a realistic hardware noise model.

quant-ph↗

arXiv2023

Quantum Inception Score

Motivated by the great success of classical generative models in machine learning, enthusiastic exploration of their quantum version has recently started. To depart on this journey, it is important to develop a relevant metric to evaluate the quality of quantum generative models; in the classical case, one such example is the (classical) inception score (cIS). In this paper, as a natural extension of cIS, we propose the quantum inception score (qIS) for quantum generators. Importantly, qIS relates the quality to the Holevo information of the quantum channel that classifies a given dataset. In this context, we show several properties of qIS. First, qIS is greater than or equal to the corresponding cIS, which is defined through projection measurements on the system output. Second, the difference between qIS and cIS arises from the presence of quantum coherence, as characterized by the resource theory of asymmetry. Third, when a set of entangled generators is prepared, there exists a classifying process leading to the further enhancement of qIS. Fourth, we harness the quantum fluctuation theorem to characterize the physical limitation of qIS. Finally, we apply qIS to assess the quality of the one-dimensional spin chain model as a quantum generative model, with the quantum convolutional neural network as a quantum classifier, for the phase classification problem in the quantum many-body physics.

quant-ph↗

arXiv2023

Detailed fluctuation theorem from the one-time measurement scheme

We study the quantum fluctuation theorem in the one-time measurement (OTM) scheme, where the work distribution of the backward process has been lacking and which is considered to be more informative than the two-time measurement (TTM) scheme. We find that the OTM scheme is the quantum nondemolition TTM scheme, in which the final state is a pointer state of the second measurement whose Hamiltonian is conditioned on the first measurement outcome. Then, by clarifying the backward work distribution in the OTM scheme, we derive the detailed fluctuation theorem in the OTM scheme for the characteristic functions of the forward and backward work distributions, which captures the detailed information about the irreversibility and can be applied to quantum thermometry. We also verified our conceptual findings with the IBM quantum computer. Our result clarifies that the laws of thermodynamics at the nanoscale are dependent on the choice of the measurement and may provide experimentalists with a concrete strategy to explore laws of thermodynamics at the nanoscale by protecting quantum coherence and correlations.

quant-ph↗

arXiv2023

Thermodynamic perspective on quantum fluctuations

What is the major difference between large and small systems? At small length-scales the dynamics is dominated by fluctuations, whereas at large scales fluctuations are irrelevant. Therefore, any thermodynamically consistent description of quantum systems necessitates a thorough understanding of the nature and consequences of fluctuations. In this chapter, we outline two closely related fields of research that are commonly considered separately -- fluctuation forces and fluctuation theorems. Focusing on the main gist of these exciting and vivid fields of modern research, we seek to provide a instructive entry point for both communities of researchers interested in learning about the other.

cond-mat.stat-mech↗

arXiv2023

Inference-Based Quantum Sensing

In a standard Quantum Sensing (QS) task one aims at estimating an unknown parameter $θ$, encoded into an $n$-qubit probe state, via measurements of the system. The success of this task hinges on the ability to correlate changes in the parameter to changes in the system response $\mathcal{R}(θ)$ (i.e., changes in the measurement outcomes). For simple cases the form of $\mathcal{R}(θ)$ is known, but the same cannot be said for realistic scenarios, as no general closed-form expression exists. In this work we present an inference-based scheme for QS. We show that, for a general class of unitary families of encoding, $\mathcal{R}(θ)$ can be fully characterized by only measuring the system response at $2n+1$ parameters. This allows us to infer the value of an unknown parameter given the measured response, as well as to determine the sensitivity of the scheme, which characterizes its overall performance. We show that inference error is, with high probability, smaller than $δ$, if one measures the system response with a number of shots that scales only as $Ω(\log^3(n)/δ^2)$. Furthermore, the framework presented can be broadly applied as it remains valid for arbitrary probe states and measurement schemes, and, even holds in the presence of quantum noise. We also discuss how to extend our results beyond unitary families. Finally, to showcase our method we implement it for a QS task on real quantum hardware, and in numerical simulations.

quant-ph↗

arXiv2023

Achieving quantum advantages for image filtering

Image processing is a fascinating field for exploring quantum algorithms. However, achieving quantum speedups turns out to be a significant challenge. In this work, we focus on image filtering to identify a class of images that can achieve a substantial speedup. We show that for images with efficient encoding and a lower bound on the signal-to-noise ratio, a quantum filtering algorithm can be constructed with a polynomial complexity in terms of the qubit number. Our algorithm combines the quantum Fourier transform with the amplitude amplification technique. To demonstrate the advantages of our approach, we apply it to three typical filtering problems. We highlight the importance of efficient encoding by illustrating that for images that cannot be efficiently encoded, the quantum advantage will diminish. Our work provides insights into the types of images that can achieve a substantial quantum speedup.

quant-ph↗

arXiv2023

Exchange fluctuation theorems for strongly interacting quantum pumps

We derive a general quantum exchange fluctuation theorem for multipartite systems with arbitrary coupling strengths by taking into account the informational contribution of the back-action of the quantum measurements, which contributes to the increase in the von-Neumann entropy of the quantum system. The resulting second law of thermodynamics is tighter than the conventional Clausius inequality. The derived bound is the quantum mutual information of the conditional thermal state, which is a thermal state conditioned on the initial energy measurement. These results elucidate the role of quantum correlations in the heat exchange between multiple subsystems.

quant-ph↗

arXiv2023

Conditional quantum thermometry -- enhancing precision by measuring less

Taking accurate measurements of the temperature of quantum systems is a challenging task. The mathematical peculiarities of quantum information make it virtually impossible to measure with infinite precision. In the present paper, we introduce a generalize thermal state, which is conditioned on the pointer states of the available measurement apparatus. We show that this conditional thermal state outperforms the Gibbs state in quantum thermometry. The origin for the enhanced precision can be sought in its asymmetry quantified by the Wigner-Yanase-Dyson skew information. This additional resource is further clarified in a fully resource-theoretic analysis, and we show that there is a Gibbs-preserving map to convert a target state into the conditional thermal state. We relate the quantum J-divergence between the conditional thermal state and the same target state to quantum heat.

quant-ph↗

arXiv2022

Jarzynski-like Equality of Nonequilibrium Information Production Based on Quantum Cross Entropy

The two-time measurement scheme is well studied in the context of quantum fluctuation theorem. However, it becomes infeasible when the random variable determined by a single measurement trajectory is associated with the von-Neumann entropy of the quantum states. We employ the one-time measurement scheme to derive a Jarzynski-like equality of nonequilibrium information production by proposing an information production distribution based on the quantum cross entropy. The derived equality further enables one to explore the roles of the quantum cross entropy in quantum communications, quantum machine learning and quantum thermodynamics.

quant-ph↗

arXiv2022

Quantum Computational Phase Transition in Combinatorial Problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that $BQP\neq NP$, it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT -- random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithm lies. Then, we show that the high problem density region, which limits QAOA's performance in hard optimization problems ({\it reachability deficits}), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

quant-ph↗

arXiv2022

Variational Quantum Algorithm for Estimating the Quantum Fisher Information

The Quantum Fisher information (QFI) quantifies the ultimate precision of estimating a parameter from a quantum state, and can be regarded as a reliability measure of a quantum system as a quantum sensor. However, estimation of the QFI for a mixed state is in general a computationally demanding task. In this work we present a variational quantum algorithm called Variational Quantum Fisher Information Estimation (VQFIE) to address this task. By estimating lower and upper bounds on the QFI, based on bounding the fidelity, VQFIE outputs a range in which the actual QFI lies. This result can then be used to variationally prepare the state that maximizes the QFI, for the application of quantum sensing. In contrast to previous approaches, VQFIE does not require knowledge of the explicit form of the sensor dynamics. We simulate the algorithm for a magnetometry setup and demonstrate the tightening of our bounds as the state purity increases. For this example, we compare our bounds to literature bounds and show that our bounds are tighter.

quant-ph↗

arXiv2021

Generalized Measure of Quantum Fisher Information

In this work, we present a lower bound on the quantum Fisher information (QFI) which is efficiently computable on near-term quantum devices. This bound itself is of interest, as we show that it satisfies the canonical criteria of a QFI measure. Specifically, it is essentially a QFI measure for subnormalized states, and hence it generalizes the standard QFI in this sense. Our bound employs the generalized fidelity applied to a truncated state, which is constructed via the $m$ largest eigenvalues and their corresponding eigenvectors of the probe quantum state $ρ_θ$. Focusing on unitary families of exact states, we analyze the properties of our proposed lower bound, and demonstrate its utility for efficiently estimating the QFI.

quant-ph↗

arXiv2021

Quantum and classical ergotropy from relative entropies

The quantum ergotropy quantifies the maximal amount of work that can be extracted from a quantum state without changing its entropy. Given that the ergotropy can be expressed as the difference of quantum and classical relative entropies of the quantum state with respect to the thermal state, we define the classical ergotropy, which quantifies how much work can be extracted from distributions that are inhomogeneous on the energy surfaces. A unified approach to treat both quantum as well as classical scenarios is provided by geometric quantum mechanics, for which we define the geometric relative entropy. The analysis is concluded with an application of the conceptual insight to conditional thermal states, and the correspondingly tightened maximum work theorem.

quant-ph↗

arXiv2021

Sub-Quantum Fisher Information

The Quantum Fisher Information (QFI) plays a crucial role in quantum information theory and in many practical applications such as quantum metrology. However, computing the QFI is generally a computationally demanding task. In this work we analyze a lower bound on the QFI which we call the sub-Quantum Fisher Information (sub-QFI). The bound can be efficiently estimated on a quantum computer for an $n$-qubit state using $2n$ qubits. The sub-QFI is based on the super-fidelity, an upper bound on Uhlmann's fidelity. We analyze the sub-QFI in the context of unitary families, where we derive several crucial properties including its geometrical interpretation. In particular, we prove that the QFI and the sub-QFI are maximized for the same optimal state, which implies that the sub-QFI is faithful to the QFI in the sense that both quantities share the same global extrema. Based on this faithfulness, the sub-QFI acts as an efficiently computable surrogate for the QFI for quantum sensing and quantum metrology applications. Finally, we provide additional meaning to the sub-QFI as a measure of coherence, asymmetry, and purity loss.

quant-ph↗