arXiv subjects

Akira Sone

Publications and source records attributed to Akira Sone.

27 records · Page 2Linked to original sources

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↗

arXiv2021

Jarzynski equality for conditional stochastic work

It has been established that the inclusive work for classical, Hamiltonian dynamics is equivalent to the two-time energy measurement paradigm in isolated quantum systems. However, a plethora of other notions of quantum work has emerged, and thus the natural question arises whether any other quantum notion can provide motivation for purely classical considerations. In the present analysis, we propose the conditional stochastic work for classical, Hamiltonian dynamics, which is inspired by the one-time measurement approach. This novel notion is built upon the change of expectation value of the energy conditioned on the initial energy surface. As main results we obtain a generalized Jarzynski equality and a sharper maximum work theorem, which account for how non-adiabatic the process is. Our findings are illustrated with the parametric harmonic oscillator.

cond-mat.stat-mech↗

arXiv2021

Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits

Variational quantum algorithms (VQAs) optimize the parameters $\vecθ$ of a parametrized quantum circuit $V(\vecθ)$ to minimize a cost function $C$. While VQAs may enable practical applications of noisy quantum computers, they are nevertheless heuristic methods with unproven scaling. Here, we rigorously prove two results, assuming $V(\vecθ)$ is an alternating layered ansatz composed of blocks forming local 2-designs. Our first result states that defining $C$ in terms of global observables leads to exponentially vanishing gradients (i.e., barren plateaus) even when $V(\vecθ)$ is shallow. Hence, several VQAs in the literature must revise their proposed costs. On the other hand, our second result states that defining $C$ with local observables leads to at worst a polynomially vanishing gradient, so long as the depth of $V(\vecθ)$ is $\mathcal{O}(\log n)$. Our results establish a connection between locality and trainability. We illustrate these ideas with large-scale simulations, up to 100 qubits, of a quantum autoencoder implementation.

quant-ph↗

arXiv2020

Quantum Jarzynski Equality in Open Quantum Systems from the One-Time Measurement Scheme

In open quantum systems, a clear distinction between work and heat is often challenging, and extending the quantum Jarzynski equality to systems evolving under general quantum channels beyond unitality remains an open problem in quantum thermodynamics. In this Letter, we introduce well-defined notions of guessed quantum heat and guessed quantum work, by exploiting the one-time measurement scheme, which only requires an initial energy measurement on the system alone. We derive a modified quantum Jarzynski equality and the principle of maximum work with respect to the guessed quantum work, which requires the knowledge of the system only. We further show the significance of guessed quantum heat and work by linking them to the problem of quantum hypothesis testing.

quant-ph↗

arXiv2019

Nonclassical correlations for quantum metrology in thermal equilibrium

Nonclassical correlations beyond entanglement might provide a resource in quantum information tasks, such as quantum computation or quantum metrology. Quantum discord is a measure of nonclassical correlations, to which entanglement belongs as a subset. Exploring the operational meaning of quantum discord as a resource in quantum information processing tasks, such as quantum metrology, is of essential importance to our understanding of nonclassical correlations. In our recent work [Phys. Rev. A, 98, 012115 (2018)], we considered a protocol---which we call the greedy local thermometry protocol--- for estimating the temperature of thermal equilibrium states from local measurements, elucidating the role of diagonal discord in enhancing the protocol sensitivity in the high-temperature limit. In this paper, we extend our results to a general greedy local parameter estimation scenario. In particular, we introduce a quantum discord---which we call discord for local metrology---to quantify the nonclassical correlations induced by the local optimal measurement on the subsystem. We demonstrate explicitly that discord for local metrology plays a role in sensitivity enhancement in the high-temperature limit by showing its relation to loss in quantum Fisher information. In particular, it coincides with diagonal discord for estimating a linear coupling parameter.

quant-ph↗

arXiv2018

Quantum Hamiltonian Identifiability via a Similarity Transformation Approach and Beyond

The identifiability of a system is concerned with whether the unknown parameters in the system can be uniquely determined with all the possible data generated by a certain experimental setting. A test of quantum Hamiltonian identifiability is an important tool to save time and cost when exploring the identification capability of quantum probes and experimentally implementing quantum identification schemes. In this paper, we generalize the identifiability test based on the Similarity Transformation Approach (STA) in classical control theory and extend it to the domain of quantum Hamiltonian identification. We employ STA to prove the identifiability of spin-1/2 chain systems with arbitrary dimension assisted by single-qubit probes. We further extend the traditional STA method by proposing a Structure Preserving Transformation (SPT) method for non-minimal systems. We use the SPT method to introduce an indicator for the existence of economic quantum Hamiltonian identification algorithms, whose computational complexity directly depends on the number of unknown parameters (which could be much smaller than the system dimension). Finally, we give an example of such an economic Hamiltonian identification algorithm and perform simulations to demonstrate its effectiveness.

quant-ph↗

arXiv2018

Quantifying precision loss in local quantum thermometry via diagonal discord

When quantum information is spread over a system through nonclassical correlation, it makes retrieving information by local measurements difficult---making global measurement necessary for optimal parameter estimation. In this paper, we consider temperature estimation of a system in a Gibbs state and quantify the separation between the estimation performance of the global optimal measurement scheme and a greedy local measurement scheme by diagonal quantum discord. In a greedy local scheme, instead of global measurements, one performs sequential local measurement on subsystems, which is potentially enhanced by feed-forward communication. We show that, for finite-dimensional systems, diagonal discord quantifies the difference in the quantum Fisher information quantifying the precision limits for temperature estimation of these two schemes, and we analytically obtain the relation in the high-temperature limit. We further verify this result by employing the examples of spins with Heisenberg's interaction.

quant-ph↗

arXiv2018

Exact dimension estimation of interacting qubit systems assisted by a single quantum probe

Estimating the dimension of an Hilbert space is an important component of quantum system identification. In quantum technologies, the dimension of a quantum system (or its corresponding accessible Hilbert space) is an important resource, as larger dimensions determine e.g. the performance of quantum computation protocols or the sensitivity of quantum sensors. Despite being a critical task in quantum system identification, estimating the Hilbert space dimension is experimentally challenging. While there have been proposals for various dimension witnesses capable of putting a lower bound on the dimension from measuring collective observables that encode correlations, in many practical scenarios, especially for multiqubit systems, the experimental control might not be able to engineer the required initialization, dynamics and observables. Here we propose a more practical strategy, that relies not on directly measuring an unknown multiqubit target system, but on the indirect interaction with a local quantum probe under the experimenter's control. Assuming only that the interaction model is given and the evolution correlates all the qubits with the probe, we combine a graph-theoretical approach and realization theory to demonstrate that the dimension of the Hilbert space can be exactly estimated from the model order of the system. We further analyze the robustness in the presence of background noise of the proposed estimation method based on realization theory, finding that despite stringent constrains on the allowed noise level, exact dimension estimation can still be achieved.

quant-ph↗

arXiv2017

Hamiltonian identifiability assisted by single-probe measurement

We study the Hamiltonian identifiability of a many-body spin-1/2 system assisted by the measure- ment on a single quantum probe based on the eigensystem realization algorithm (ERA) approach employed in Phys. Rev. Lett. 113, 080401 (2014). We demonstrate a potential application of Gröbner basis to the identifiability test of the Hamiltonian, and provide the necessary experimental resources, such as the lower bound in the number of the required measurement points, the upper bound in total required evolution time, and thus the total measurement time. Focusing on the examples of the identifiability in the spin chain model with nearest-neighboring interaction, we classify the spin-chain Hamiltonian based on its identifiability, and provide the control protocols to engineer the nonidentifiable Hamiltonian to be an identifiable Hamiltonian.

quant-ph↗