Qudit-native measurement protocol for dynamical correlations using Hadamard tests
Pavel P. Popov, Kevin T. Geier, Valentin Kasper, Maciej Lewenstein, Philipp Hauke
备注：
7+4 pages, 3 figures. Version as published in PRA. Main chainges: extended motivation of physical benchmark scenario, added discussion of potential implementation on NISQ devices, corrected global factor in the formula for the variance, amended derivations in Appendix
Dynamical correlations reveal important out-of-equilibrium properties of the underlying quantum many-body system, yet they are notoriously difficult to measure in experiments. While measurement protocols for dynamical correlations based on Hadamard tests for qubit quantum devices exist, they do not straightforwardly extend to qudits. Here, we propose a modified protocol to overcome this limitation by decomposing qudit observables into unitary operations that can be implemented and probed in a quantum circuit. We benchmark our algorithm numerically at the example of quench dynamics in a spin-1 XXZ chain with finite shot noise and demonstrate advantages in terms of the signal-to-noise ratio over established protocols based on linear response. Our scheme can readily be implemented on various platforms and offers a wide range of applications like variational quantum optimization and probing thermalization in many-body systems.
A Qudit-native Framework for Discrete Time Crystals
Institute of Physics, Chinese Academy of Sciences（中国科学院物理研究所）；University of Chinese Academy of Sciences（中国科学院大学）；Beijing Academy of Quantum Information Sciences（北京量子信息科学研究院）；Hefei National Laboratory（合肥国家实验室）；Songshan Lake Materials Laboratory（松山湖材料实验室）
Most quantum computing architectures to date natively support multi-valued logic, albeit being typically operated in a binary fashion. Multi-valued, or qudit, quantum processors have access to much richer forms of quantum entanglement, which promise to significantly boost the performance and usefulness of quantum devices. However, much of the theory as well as corresponding design methods required for exploiting such hardware remain insufficient and generalizations from qubits are not straightforward. A particular challenge is the compilation of quantum circuits into sets of native qudit gates…
The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and a qudit-specific implementation of the QFT is hence an important step toward the realization of qudit-based quantum computers. This work develops a circuit decomposition of the QFT for hybrid qudits based on generalized Hadamard and generalized controlled-phase gates, which can be implemented using selective rotations in NMR. We experimentally implement the hybrid qudit QFT on an NMR quantum emulator, which uses four qubits to emulate a single qutrit coupled to two qubits.
We develop a procedure of generalized continuous dynamical decoupling (GCDD) for an ensemble of $d$-level systems (qudits), allowing one to protect the action of an arbitrary multi-qudit gate from general noise. We first present our GCDD procedure for the case of an arbitrary qudit and apply it to the case of a Hadamard gate acting on a qutrit. This is done using a model that, in principle, could be implemented using the three magnetic hyperfine states of the ground energy level of $^{87}\mathrm{Rb}$ and laser beams whose intensities and phases are modulated according to our prescription. We s…
A pure quantum state of N subsystems with d levels each is called k-multipartite maximally entangled state, written k-uniform, if all its reductions to k qudits are maximally mixed. These states form a natural generalization of N-qudits GHZ states which belong to the class 1-uniform states. We establish a link between the combinatorial notion of orthogonal arrays and k-uniform states and prove the existence of several new classes of such states for N-qudit systems. In particular, known Hadamard matrices allow us to explicitly construct 2-uniform states for an arbitrary number of N>5 qubits. We…
We propose a simpler and more efficient scheme for the implementation of the multi-valued Grover's quantum search. The multi-valued search generalizes the original Grover's search by replacing qubits with qudits --- quantum systems of $d$ discrete states. The qudit database is exponentially larger than the qubit database and thus it requires fewer particles to control. The Hadamard gate, which is the key elementary gate in the qubit implementation of Grover's search, is replaced by a $d$-dimensional (complex-valued) unitary matrix $F$, the only condition for which is to have a column of equal …
We introduce a dichromatic calculus (RG) for qutrit systems. We show that the decomposition of the qutrit Hadamard gate is non-unique and not derivable from the dichromatic calculus. As an application of the dichromatic calculus, we depict a quantum algorithm with a single qutrit. Since it is not easy to decompose an arbitrary d by d unitary matrix into Z and X phase gates when d > 2, the proof of the universality of qudit ZX calculus for quantum mechanics is far from trivial. We construct a counterexample to Ranchin's universality proof, and give another proof by Lie theory that the qudit ZX …
In the paper (math-ph/0504049) Jarlskog gave an interesting simple parametrization to unitary matrices, which was essentially the canonical coordinate of the second kind in the Lie group theory (math-ph/0505047). In this paper we apply the method to a quantum computation based on multi-level system (qudit theory). Namely, by considering that the parametrization gives a complete set of modules in qudit theory, we construct the generalized Pauli matrices which play a central role in the theory and also make a comment on the exchange gate of two-qudit systems. Moreover we give an explicit constru…
In this chapter a quantum communication protocol with use of repeaters is presented. The protocol is constructed for qudits i.e. the generalized quantum information units. One-dit teleportation is based on the generalized Pauli-Z (phase-flip) gate's correction. This approach avoids using Pauli-X and Hadamard gates unlike in other known protocols based on quantum repeaters which were constructed for qubits and qudits. It is also important to mention that the repeaters based on teleportation protocol, described in this chapter, allow a measurement in the standard base (what simplifies the measur…
We present a gauge invariant digitization of $(1+1)$d scalar quantum electrodynamics for an arbitrary spin truncation for qudit-based quantum computers. We provide a construction of the Trotter operator in terms of a universal qudit-gate set. The cost savings of using a qutrit based spin-1 encoding versus a qubit encoding are illustrated. We show that a simple initial state could be simulated on current qutrit based hardware using noisy simulations for two different native gate set.
Consider the problem: Alice wishes to send the same key to $n-1$ users (Bob, Carol,. . . , Nathan), while preventing eavesdropper Eve from acquiring information without being detected. The problem has no solution in the classical cryptography but in quantum telecommunication there are some codes to solve the problem. In the paper \cite{zengetall}, Guo-Jyun Zeng, Kuan-Hung Chen, Zhe-Hua Chang, Yu-Shan Yang, and Yao-Hsin Chou from one side and Cabello in \cite{cabello} from other side, used Hadamard gates, Pauli gates in providing the quantum communication code for two-partity telecommunication …
Experimental realization of automated error correction is demonstrated through IBM Quantum Experience for Bell and GHZ states using a measurement based approach upon ancilla qubits. The measurement automatically activates error correcting unitary operations to restore the system to its original entangled state. We illustrate the algorithm for the maximally entangled qudit case by applying appropriate Hadamard and Controlled-NOT gates.
Non-Abelian String-Breaking Dynamics on a Qudit Quantum Computer
Universität Innsbruck（因斯布鲁克大学）；Institute for Quantum Optics and Quantum Information, Austrian Academy of Sciences（奥地利科学院量子光学与量子信息研究所）；Institute for Theoretical Physics, University of Innsbruck（因斯布鲁克大学理论物理研究所）；Instituto de Física Teórica UAM-CSIC, Universidad Autónoma de Madrid（马德里自治大学-西班牙国家科学研究委员会理论物理研究所）
Spectator-transition crosstalk in a spin-3/2 silicon-vacancy qudit in silicon carbide revealed by broadband Ramsey interferometry
Gwangju Institute of Science and Technology（光州科学技术院）；Linköping University（林雪平大学）；National Institutes for Quantum Science and Technology (QST)（国立量子科学和技术研究院）；Tohoku University（东北大学）；Korea Multi-purpose Accelerator Complex, Korea Atomic Energy Research Institute（韩国多功能加速器装置，韩国原子能研究所）
National Laboratory of Solid State Microstructures, School of Physics, Nanjing University（南京大学固体微结构物理国家重点实验室）；Collaborative Innovation Center of Advanced Microstructures, Nanjing University（南京大学先进微结构协同创新中心）；Atominstitut, Technische Universität Wien（维也纳工业大学原子研究所）；Institute for Quantum Optics and Quantum Information - IQOQI Vienna, Austrian Academy of Sciences（奥地利科学院维也纳量子光学和量子信息研究所）
Adaptive Interpolating Quantum Transform: A Quantum-Native Framework for Efficient Transform Learning
Quemix Inc.（Quemix公司）；Department of Physics, The University of Tokyo（东京大学物理学系）；Quantum Materials and Applications Research Center, National Institutes for Quantum Science and Technology（国立量子科学技术研究院量子材料与应用研究中心）；Physics Division, Sophia University（上智大学物理学科）
HPE Quantum, Emergent Machine Intelligence, HPE Labs（惠普企业量子计算、新兴机器学习实验室）；Quantum Artificial Intelligence Laboratory, NASA Ames Research Center（美国国家航空航天局艾姆斯研究中心量子人工智能实验室）；KBR, Inc.（KBR公司）；USRA Research Institute for Advanced Computer Science（大学空间研究协会先进计算机科学研究所）；School of Electrical Engineering and Telecommunications, UNSW Sydney（新南威尔士大学悉尼分校电气与电信工程学院）；ARC Centre of Excellence for Quantum Computation and Communication Technology（ARC量子计算与通信技术卓越中心）
The problem of Hadamard quantum coin measurement in $n$ trials, with arbitrary number of repeated consecutive last states is formulated in terms of Fibonacci sequences for duplicated states, Tribonacci numbers for triplicated states and $N$-Bonacci numbers for arbitrary $N$-plicated states. The probability formulas for arbitrary position of repeated states are derived in terms of Lucas and Fibonacci numbers. For generic qubit coin, the formulas are expressed by Fibonacci and more general, $N$-Bonacci polynomials in qubit probabilities. The generating function for probabilities, the Golden Rati…
Quantum communication protocols are typically formulated in terms of abstract qudit states and operations, leaving the question of an experimental realization open. Direct translation of these protocols, say into single photons with some d-dimensional degree of freedom, are typically challenging to realize. Multi-mode coherent states, on the other hand, can be easily generated experimentally. Reformulation of protocols in terms of these states has been a successful strategy for implementation of quantum protocols. Quantum key distribution and the quantum fingerprinting protocol have both follo…
Quantum-Adaptive KS($φ$): A Parameterized Three-Qubit Gate Family Embedding Toffoli with Measurement-Free Phase Kickback and Intrinsic Error Non-Amplification
