Hideo Mabuchi
I propose a quantum trajectories approach to parametric identification of the effective Hamiltonian for a Markovian open quantum system, and discuss an application motivated by recent experiments in cavity quantum electrodynamics. This example illustrates a strategy for quantum parameter estimation that efficiently utilizes the information carried by correlations between measurements distributed in time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The problem of identifying the dynamical Lie algebras of finite-level quantum systems subject to external control is considered, with special emphasis on systems that are not completely controllable. In particular, it is shown that the dynamical Lie algebra for an N-level system with equally spaced energy levels and uniform transition dipole moments, is a subalgebra for $so(N)$ if $N=2\ell+1$, and a subalgebra of $sp(\ell)$ if $N=2\ell$. General conditions for obtaining either $so(2\ell+1)$ or $sp(\ell)$ are established.
We develop a general approach for monitoring and controlling evolution of open quantum systems. In contrast to the master equations describing time evolution of density operators, here, we formulate a dynamical equation for the evolution of the process matrix acting on a system. This equation is applicable to non-Markovian and/or strong coupling regimes. We propose two distinct applications for this dynamical equation. We first demonstrate identification of quantum Hamiltonians generating dynamics of closed or open systems via performing process tomography. In particular, we argue how one can …
A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and new sequences are ``refuelled'' from a shared provably secret key transferred through the quantum channel. Two identification protocols are devised. The first protocol can be applied when legitimate users have an unjammable public channel at their disposal. The deception probability is derived for the case of a noisy quantum channel. The second protocol employs unconditionally secure authentication of informati…
The trivalent functions of a trit can be grouped into equipartitions of three elements. We discuss the separation of the corresponding functional classes by quantum state identifications.
This paper has been withdrawn by the authors; replaced by arXiv:0705.2531v2 [quant-ph].
Quantum Hamiltonian identification is important for characterizing the dynamics of quantum systems, calibrating quantum devices and achieving precise quantum control. In this paper, an effective two-step optimization (TSO) quantum Hamiltonian identification algorithm is developed within the framework of quantum process tomography. In the identification method, different probe states are inputted into quantum systems and the output states are estimated using the quantum state tomography protocol via linear regression estimation. The time-independent system Hamiltonian is reconstructed based on …
Probabilistic quantum cloning and identifying machines can be constructed via unitary-reduction processes [Duan and Guo, Phys. Rev. Lett. 80, 4999 (1998)]. Given the cloning (identifying) probabilities, we derive an explicit representation of the unitary evolution and corresponding Hamiltonian to realize probabilistic cloning (identification). The logic networks are obtained by decomposing the unitary representation into universal quantum logic operations. The robustness of the networks is also discussed. Our method is suitable for a $k$-partite system, such as quantum computer, and may be gen…
The aim of quantum system identification is to estimate the ingredients inside a black box, in which some quantum-mechanical unitary process takes place, by just looking at its input-output behavior. Here we establish a basic and general framework for quantum system identification, that allows us to classify how much knowledge about the quantum system is attainable, in principle, from a given experimental setup. Prior knowledge on some elements of the black box helps the system identification. We present an example in which a Bell measurement is more efficient to identify the system. When the …
Identifying Hamiltonian of a quantum system is of vital importance for quantum information processing. In this Letter, we realized and benchmarked a quantum Hamiltonian identification algorithm recently proposed [Phys. Rev. Lett. \textbf{113}, 080401 (2014)]. we realized the algorithm on liquid nuclear magnetic resonance quantum information processor using two different working media with different forms of Hamiltonian. Our experiment realized the quantum identification algorithm based on free induction decay signals. We also showed how to process data obtained in practical experiment. We stud…
We formulate and study, in general terms, the problem of quantum system identification, i.e., the determination (or estimation) of unknown quantum channels through their action on suitably chosen input density operators. We also present a quantitative analysis of the worst-case performance of these schemes.
We consider the task of intrinsic control system identification for quantum devices. The problem of experimental determination of subspace confinement is considered, and simple general strategies for full Hamiltonian identification and decoherence characterization of a controlled two-level system are presented.
Applying the Fiat-Shamir transform on identification schemes is one of the main ways of constructing signature schemes. While the classical security of this transformation is well understood, it is only very recently that generic results for the quantum case have been proposed [DFMS19,LZ19]. These results are asymptotic and therefore can't be used to derive the concrete security of these signature schemes without a significant loss in parameters. In this paper, we show that if we start from a commit-and-open identification scheme, where the prover first commits to several strings and then as a…
The system identification problem is to estimate dynamical parameters from the output data, obtained by performing measurements on the output fields. We investigate system identification for quantum linear systems. Our main objectives are to address the following general problems: (1) Which parameters can be identified by measuring the output? (2) How can we construct a system realisation from sufficient input-output data? (3) How well can we estimate the parameters governing the dynamics? We investigate these problems in two contrasting approaches; using time-dependent inputs or time-stationa…
Estimating the parameters that dictate the dynamics of a quantum system is an important task for quantum information processing and quantum metrology, as well as fundamental physics. In this paper we develop a method for parameter estimation for Markovian open quantum systems using a temporal record of measurements on the system. The method is based on system realization theory and is a generalization of our previous work on identification of Hamiltonian parameters [Phys. Rev. Lett. 113, 080401 (2014)].
We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical-quantum (cq) channels and "quantum fingerprinting". We show that the identification capacity of a discrete memoryless quantum channel for classical information can be larger than that for transmission; this is in contrast to all previously considered models, where it turns out to equal the common randomness capacity (equals transmission capacity in our case): in particular, for a noiseless qubit, we show the i…
In [1], it is shown that the simultaneous identification capacity region for the discrete, memoryless, classical-quantum multiple access channel is equal to the transmission capacity region for codes using a deterministic encoding scheme. Here, we use transmission codes with a stochastic encoding scheme and show that the analogous capacity theorem holds. Further, by using stochastic encoders, the proof of achievability is highly simplified.
I consider the use of entanglement between two parties to enable one to authenticate her identity to another over a quantum communication channel. Exploiting the phenomenon of entanglement-catalyzed transformations between pure states gives a potentially reusable entangled identification token. In analyzing this, I consider the independently interesting problem of the best possible approximation to a given pure entangled state realizable using local actions and classical communication by parties sharing a different entangled state.
Procedures are given below to construct symmetric and anti-symmetric quantum functions. If hidden in an oracle, such functions can be identified exactly, without iterative interrogation. This is another example of quantum search. The resulting positive (or negative) functions also serve to uniquely reorganize a superposition of states to give a basis state for testing purposes.
The ability to identify cause-effect relations is an essential component of the scientific method. The identification of causal relations is generally accomplished through statistical trials where alternative hypotheses are tested against each other. Traditionally, such trials have been based on classical statistics. However, classical statistics becomes inadequate at the quantum scale, where a richer spectrum of causal relations is accessible. Here we show that quantum strategies can greatly speed up the identification of causal relations. We analyse the task of identifying the effect of a gi…
We realize the probabilistic cloning and identifying linear independent quantum states of multi-particles system, given prior probability, with universal quantum logic gates using the method of unitary representation. Our result is universal for separate state and entanglement. We also provide the realization in the condition given $M$ initial copies for each state.
Suppose we want to distinguish two quantum pure states. We consider the case in which no classical knowledge on the two states is given and only a pair of samples of the two states is available. This problem is called quantum pure-state identification problem. Our task is to optimize the mean identification success probability, which is averaged over an independent unitary invariant distribution of the two reference states. In this paper, the two states are assumed bipartite states which are generally entangled. The question is whether the maximum mean identification success probability can be…
Topology identification comprises reconstructing the interaction Hamiltonian of a quantum network by properly processing measurements of its density operator within a fixed time interval. It finds application in several quantum technology contexts, ranging from quantum communication to quantum computing or sensing. In this paper, we provide analytical conditions for the solvability of the topology identification problem for autonomous quantum dynamical networks. The solvability condition is then converted in an algorithm for quantum network reconstruction that is easily implementable on standa…
Molecular resonance identification in complex absorbing potentials via integrated quantum computing and high-throughput computing
本文提出qDRIVE算法，结合量子计算与高通量计算，利用复杂吸收势方法加速分子共振态识别，通过异步并行执行减少计算时间，验证了其在模拟量子处理器中的有效性。
Sparse identification of quantum Hamiltonian dynamics via quantum circuit learning
本文提出SIQHDy方法，利用量子电路学习从量子测量数据中稀疏识别量子哈密顿动力学，验证其在多自旋系统中的有效性与鲁棒性。
In a recent paper, [Phys. Rev. A 65, 052326 (2002)], Mihara presented several cryptographic protocols that were claimed to be quantum mechanical in nature. In this comment it is pointed out that these protocols can be described in purely classical terms. Hence, the security of these schemes does not rely on the usage of entanglement or any other quantum mechanical property.
The identification of time-varying \textit{in situ} signals is crucial for characterizing the dynamics of quantum processes occurring in highly isolated environments. Under certain circumstances, they can be identified from time-resolved measurements via Ramsey interferometry experiments, but only with very special probe systems can the signals be explicitly read out, and a theoretical analysis is lacking on whether the measurement data are sufficient for unambiguous identification. In this paper, we formulate this problem as the invertibility of the underlying quantum input-output system, and…
A quantum key distribution and identification protocol is proposed, which is based on entanglement swapping. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping, identify each other and obtain the secure key according to the measurement results. Because the two particles measured together are selected out randomly, we need neither alternative measurements nor rotation of the Bell states. Furthermore, less Bell measurements are needed in our protocol than in the previous similar ones.
The Cramer-Rao bound, satisfied by classical Fisher information, a key quantity in information theory, has been shown in different contexts to give rise to the Heisenberg uncertainty principle of quantum mechanics. In this paper, we show that the identification of the mean quantum potential, an important notion in Bohmian mechanics, with the Fisher information, leads, through the Cramer-Rao bound, to an uncertainty principle which is stronger, in general, than both Heisenberg and Robertson-Schrodinger uncertainty relations, allowing to experimentally test the validity of such an identification…
Suppose we want to identify an input state with one of two unknown reference states, where the input state is guaranteed to be equal to one of the reference states. We assume that no classical knowledge of the reference states is given, but a certain number of copies of them are available instead. Two reference states are independently and randomly chosen from the state space in a unitary invariant way. This is called the quantum state identification problem, and the task is to optimize the mean identification success probability. In this paper, we consider the case where each reference state …
In this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's recently discovered appoach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking values in selfadjoint operators on a Hilbert space. This theory is presented separately in an appendix, and we illustrate it by showing its application to quantum generalizations of classical hypergraph cov…
We present simple protocols for oblivious transfer and password-based identification which are secure against general attacks in the noisy-quantum-storage model as defined in [KWW09]. We argue that a technical tool from [KWW09] suffices to prove security of the known protocols. Whereas the more involved protocol for oblivious transfer from [KWW09] requires less noise in storage to achieve security, our "canonical" protocols have the advantage of being simpler to implement and the security error is easier control. Therefore, our protocols yield higher OT-rates for many realistic noise parameter…
This paper considers Hamiltonian identification for a controllable quantum system with non-degenerate transitions and a known initial state. We assume to have at our disposal a single scalar control input and the population measure of only one state at an (arbitrarily large) final time T. We prove that the quantum dipole moment matrix is locally observable in the following sense: for any two close but distinct dipole moment matrices, we construct discriminating controls giving two different measurements. Such discriminating controls are constructed to have three well defined temporal component…
Achievable Identification Rates in Noisy Bosonic Broadcast Channels
本文研究了在噪声玻色广播信道中利用相干态实现的识别率，并通过量子假设检验和离散子集近似来维持功率约束。
Engineering quantum systems offers great opportunities both technologically and scientifically for communication, computation, and simulation. The construction and operation of large scale quantum information devices presents a grand challenge and a major issue is the effective control of coherent dynamics. This is often in the presence of decoherence which further complicates the task of determining the behaviour of the system. Here, we show how to determine open system Markovian dynamics of a quantum system with restricted initialisation and partial output state information.
Quantum systems with real energies generated by an apparently non-Hermitian Hamiltonian may re-acquire the consistent probabilistic interpretation via an ad hoc metric which specifies the set of observables in the updated Hilbert space of states. The recipe is extended here to quantum toboggans. In the first step the tobogganic integration path is rectified and the Schroedinger equation is given the generalized eigenvalue-problem form. In the second step the general double-series representation of the eligible metric operators is derived.
Identifying the Hamiltonian of a quantum system from experimental data is considered. General limits on the identifiability of model parameters with limited experimental resources are investigated, and a specific Bayesian estimation procedure is proposed and evaluated for a model system where a-priori information about the Hamiltonian's structure is available.
High-precision nonlocal temporal correlation identification in the entangled photon pairs is critical to measure the time offset between remote independent time scales for many quantum information applications. The first nonlocal correlation identification was reported in 2009, which extracts the time offset via the algorithm of iterative fast Fourier transformations (FFTs) and their inverse. The least identification resolution is restricted by the peak identification threshold of the algorithm, and thus the time offset calculation precision is limited. In this paper, an improvement for the id…
Here we discuss message identification, a problem formalized by Rudolf Ahlswede and Gunter Dueck, over a classical-quantum multiple access channel with two classical senders and one quantum receiver. We show that the simultaneous identification capacity, a capacity defined by Peter Löber, of this multiple access channel is equal to its message transmission capacity region.
Ice cream, chocolate, random identification codes, quantum error correction -- and a truly warm heart
本文纪念维克多·西多连科，赞扬其科学贡献、善良品质及积极影响。
QOMIC: Quantum optimization for motif identification
针对经典计算机求解非重叠网络模体识别计算难度高的问题，提出首个量子优化方案QOMIC，通过整数模型转化问题并构建量子电路，实验显示其模体计数优于经典方案，可高效识别五种神经退行性疾病相关人类调控网络中的模体。
We consider online detection strategies for identifying a change point in a stream of quantum particles allegedly prepared in identical states. We show that the identification of the change point can be done without error via sequential local measurements while attaining the optimal performance bound set by quantum mechanics. In this way, we establish the task of exactly identifying a quantum change point as an instance where local protocols are as powerful as global ones. The optimal online detection strategy requires only one bit of memory between subsequent measurements, and it is amenable …
Recently, major progress has been made towards the realisation of quantum internet to enable a broad range of classically intractable applications. These applications such as delegated quantum computation require running a secure identification protocol between a low-resource and a high-resource party to provide secure communication. In this work, we propose two identification protocols based on the emerging hardware secure solutions, the quantum Physical Unclonable Functions (qPUFs). The first protocol allows a low-resource party to prove its identity to a high-resource party and in the secon…
In this work we probe the impact of channel estimation on the performance of quantum LDPC codes. Our channel estimation is based on an optimal estimate of the relevant decoherence parameter via its quantum Fisher information. Using state-of-the art quantum LDPC codes designed for the quantum depolarization channel, and utilizing various quantum probes with different entanglement properties, we show how the performance of such codes can deteriorate by an order of magnitude when optimal channel identification is fed into a belief propagation decoding algorithm. Our work highlights the importance…
In this paper, we develop a system identification algorithm to identify a model for unknown linear quantum systems driven by time-varying coherent states, based on empirical single-shot continuous homodyne measurement data of the system's output. The proposed algorithm identifies a model that satisfies the physical realizability conditions for linear quantum systems, challenging constraints not encountered in classical (non-quantum) linear system identification. Numerical examples on a multiple-input multiple-output optical cavity model are presented to illustrate an application of the identif…
Zero-entropy encoders and simultaneous decoders in identification via quantum channels
本文研究量子信道识别中纯态编码与同时解码对容量的影响，证明四种编码-解码组合均具有双指数码规模，并揭示三种识别容量之间存在严格的大小关系。
This paper gives an overview of parameter estimation and system identification for quantum input-output systems by continuous observation of the output field. We present recent results on the quantum Fisher information of the output with respect to unknown dynamical parameters. We discuss the structure of continuous-time measurements as solutions of the quantum Zakai equation, and their relationship to parameter estimation methods. Proceeding beyond parameter estimation, the paper also gives an overview of the emerging topic of quantum system identification for black-box modeling of quantum sy…
Identification schemes are interactive protocols typically involving two parties, a prover, who wants to provide evidence of his or her identity and a verifier, who checks the provided evidence and decide whether it comes or not from the intended prover. In this paper, we comment on a recent proposal for quantum identity authentication from Zawadzki, and give a concrete attack upholding theoretical impossibility results from Lo and Buhrman et al. More precisely, we show that using a simple strategyan adversary may indeed obtain non-negligible information on the shared identification secret. Wh…
Identification Over Quantum Broadcast Channels
本文研究量子广播信道上的识别问题，推导了可达识别区域并完整刻画了经典-量子广播信道类，同时得到了单模纯损耗玻色子广播信道的识别容量区域，改进了量子擦除广播信道上的已知最佳界。
Identification and Mitigating Bias in Quantum Machine Learning
本文围绕量子机器学习中的偏差问题，系统探讨其表现形式、产生原因及识别、诊断与缓解策略，为该领域偏差治理提供研究框架。
Identification Via Quantum Channels
本文回顾了Ahlswede和Dueck经由信道识别理论的量子化发展，指出存在多种量子化概念，包括两种经典信息识别概念和三种量子信息识别容量，并聚焦于概念要点与开放问题。
Combination of a construction of unambiguous quantum conditions out of the conventional one and a simultaneous quantization of the positions, momenta, angular momenta and Hamiltonian leads to the geometric potential given by the so-called thin-lay quantization.
Quantum gate identification: error analysis, numerical results and optical experiment
本文提出了一种基于量子过程层析的量子门识别方法，通过输入纯态并进行快速态层析来重构量子门，并在单光子水平上验证了该方法的有效性。
In the oracle identification problem we have oracle access to bits of an unknown string $x$ of length $n$, with the promise that it belongs to a known set $C\subseteq\{0,1\}^n$. The goal is to identify $x$ using as few queries to the oracle as possible. We develop a quantum query algorithm for this problem with query complexity $O\left(\sqrt{\frac{n\log M }{\log(n/\log M)+1}}\right)$, where $M$ is the size of $C$. This bound is already derived by Kothari in 2014, for which we provide a more elegant simpler proof.
Quantum spatial best-arm identification via quantum walks
本文提出量子空间最佳臂识别算法，利用量子行走处理图结构约束下的多臂老虎机问题，分析完全图和二分图中的最佳臂识别概率及时间。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。