The ability of quantum computers to directly manipulate and analyze quantum states stored in quantum memory allows them to learn about aspects of our physical world that would otherwise be invisible given a modest number of measurements. Here we investigate a new learning resource which could be available to quantum computers in the future -- measurements on the unknown state accompanied by its complex conjugate $ρ\otimes ρ^\ast$. For a certain shadow tomography task, we surprisingly find that measurements on only copies of $ρ\otimes ρ^\ast$ can be exponentially more powerful than measurements on $ρ^{\otimes K}$, even for large $K$. This expands the class of provable exponential advantages using only a constant overhead quantum memory, or minimal quantum memory, and we provide a number of examples where the state $ρ^\ast$ is naturally available in both computational and physical applications. In addition, we precisely quantify the power of classical shadows on single copies under a generalized Clifford ensemble and give a class of quantities that can be efficiently learned. The learning task we study in both the single copy and quantum memory settings is physically natural and corresponds to real-space observables with a limit of bosonic modes, where it achieves an exponential improvement in detecting certain signals under a noisy background. We quantify a new and powerful resource in quantum learning, and we believe the advantage may find applications in improving quantum simulation, learning from quantum sensors, and uncovering new physical phenomena.
Quantum optical coherence tomography (Q-OCT) offers a factor-of-two improvement in axial resolution and the advantage of even-order dispersion cancellation when it is compared to conventional OCT (C-OCT). These features have been ascribed to the non-classical nature of the biphoton state employed in the former, as opposed to the classical state used in the latter. Phase-conjugate OCT (PC-OCT), introduced here, shows that non-classical light is not necessary to reap Q-OCT's advantages. PC-OCT uses classical-state signal and reference beams, which have a phase-sensitive cross-correlation, togeth…
In communication complexity, a number of distant parties have the task of calculating a distributed function of their inputs, while minimizing the amount of communication between them. It is known that with quantum resources, such as entanglement and quantum channels, one can obtain significant reductions in the communication complexity of some tasks. In this work, we study the role of the quantum superposition of the direction of communication as a resource for communication complexity. We present a tripartite communication task for which such a superposition allows for an exponential saving …
Optical homodyne detection has been widely used in continuous-variable (CV) quantum information processing for measuring field quadrature values. In this paper we explore the possibility of operating a conjugate homodyne detection system in "photon counting" mode to implement discrete-variable (DV) quantum key distribution (QKD) protocols. A conjugate homodyne detection system, which consists of a beam splitter followed by two optical homodyne detectors, can simultaneously measure a pair of conjugate quadratures X and P of the incoming quantum state. In classical electrodynamics, X^2 + P^2 is …
The Jordan structure of finite-dimensional quantum theory is derived, in a conspicuously easy way, from a few simple postulates concerning abstract probabilistic models (each defined by a set of basic measurements and a convex set of states). The key assumption is that each system A can be paired with an isomorphic $\textit{conjugate}$ system, $\overline{A}$, by means of a non-signaling bipartite state $η_A$ perfectly and uniformly correlating each basic measurement on A with its counterpart on $\overline{A}$. In the case of a quantum-mechanical system associated with a complex Hilbert space $…
This work analyses the performance of quantum circuits and general processes to transform $k$ uses of an arbitrary unitary operation $U$ into another unitary operation $f(U)$. When the desired function $f$ a homomorphism, i.e., $f(UV)=f(U)f(V)$, it is known that optimal average fidelity is attainable by parallel circuits and indefinite causality does not provide any advantage. Here we show that the situation changes dramatically when considering anti-homomorphisms, i.e., $f(UV)=f(V)f(U)$. In particular, we prove that when $f$ is an anti-homomorphism, sequential circuits could exponentially out…
Exponential entanglement advantage in sensing correlated noise
Joint Center for Quantum Information and Computer Science, NIST/University of Maryland(量子信息与计算机科学联合中心,美国国家标准与技术研究院/马里兰大学);Department of Physics, Harvard University(哈佛大学物理系);Joint Quantum Institute, NIST/University of Maryland(量子信息联合研究所,美国国家标准与技术研究院/马里兰大学);IBM Quantum, IBM T.J. Watson Research Center(IBM量子,IBM托马斯·J·沃森研究中心);Department of Physics, Korea Advanced Institute of Science and Technology(韩国科学技术院物理系)
Finding exponential separation between quantum and classical information tasks is like striking gold in quantum information research. Such an advantage is believed to hold for quantum computing but is proven for quantum communication complexity. Recently, a novel quantum resource called the quantum switch---which creates a coherent superposition of the causal order of events, known as quantum causality---has been harnessed theoretically in a new protocol providing provable exponential separation. We experimentally demonstrate such an advantage by realizing a superposition of communication dire…
Quantum advantage in learning single mode bosonic channels
A*STAR Quantum Innovation Centre(Q.InC), Agency for Science, Technology and Research(A*STAR)(A*STAR量子创新中心);Centre for Quantum Software and Information, University of Technology Sydney(悉尼科技大学量子软件与信息研究中心);Department of Quantum Science and Technology, Research School of Physics, The Australian National University(澳大利亚国立大学物理研究学院量子科学与技术系);Centre for Quantum Technologies, National University of Singapore(新加坡国立大学量子技术中心);Q-CTRL
We demonstrate the possibility of (sub)exponential quantum speedup via a quantum algorithm that follows an adiabatic path of a gapped Hamiltonian with no sign problem. This strengthens the superpolynomial separation recently proved by Hastings. The Hamiltonian that exhibits this speed-up comes from the adjacency matrix of an undirected graph, and we can view the adiabatic evolution as an efficient $\mathcal{O}(\mathrm{poly}(n))$-time quantum algorithm for finding a specific "EXIT" vertex in the graph given the "ENTRANCE" vertex. On the other hand we show that if the graph is given via an adjac…
We study how unique features of non-Hermitian lattice systems can be harnessed to improve Hamiltonian parameter estimation in a fully quantum setting. While the so-called non-Hermitian skin effect does not provide any distinct advantage, alternate effects yield dramatic enhancements. We show that certain asymmetric non-Hermitian tight-binding models with a $\mathbb{Z}_2$ symmetry yield a pronounced sensing advantage: the quantum Fisher information per photon increases exponentially with system size. We find that these advantages persist in regimes where non-Markovian and non-perturbative effec…
Quantum metrology shows that by exploiting nonclassical resources it is possible to overcome the fundamental limit of precision found for classical parameter-estimation protocols. The scaling of the quantum Fisher information -- which provides an upper bound to the achievable precision -- with respect to the protocol duration is then of primarily importance to assess its performances. In classical protocols the quantum Fisher information scales linearly with time, while typical quantum-enhanced strategies achieve a quadratic (Heisenberg) or even higher-order polynomial scalings. Here we report…
On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
Graduate School of Engineering Science, The University of Osaka(大阪大学工学研究科);Center for Quantum Information and Quantum Biology, The University of Osaka(大阪大学量子信息与量子生物学中心);Center for Quantum Computing, RIKEN(理化学研究所量子计算中心)
Harvard Society of Fellows(哈佛大学研究员学会);Black Hole Initiative(黑洞计划);Institute for Quantum Information and Matter, Caltech(加州理工学院量子信息与物质研究所);Department of Computing and Mathematical Sciences, Caltech(加州理工学院计算与数学科学系);Google Quantum AI(谷歌量子人工智能)
It has been shown that the apparent advantage of some quantum machine learning algorithms may be efficiently replicated using classical algorithms with suitable data access -- a process known as dequantization. Existing works on dequantization compare quantum algorithms which take copies of an n-qubit quantum state $|x\rangle = \sum_{i} x_i |i\rangle$ as input to classical algorithms which have sample and query (SQ) access to the vector $x$. In this note, we prove that classical algorithms with SQ access can accomplish some learning tasks exponentially faster than quantum algorithms with quant…
Quantum linear solvers for quantum chemistry: prospects of exponential quantum advantage
Centre for Quantum Engineering, Research and Education, TCG CREST(TCG CREST 量子工程、研究与教育中心);Department of Physics, IIT Tirupati(蒂鲁帕提印度理工学院物理系);Deloitte Tohmatsu LLC(德勤审计法人有限公司);Indian Association for the Cultivation of Science(印度科学培育协会);Donostia international physics centre(圣塞巴斯蒂安国际物理中心);Academy of Scientific and Innovative Research (AcSIR)(科学与创新研究学院)