Related papers: Quantum Algorithms for Testing Hamiltonian Symmetr…
By repeated trials, one can determine the fairness of a classical coin with a confidence which grows with the number of trials. A quantum coin can be in a superposition of heads and tails and its state is most generally a density matrix.…
Determining the Hamiltonian of a quantum system is essential for understanding its dynamics and validating its behavior. Hamiltonian learning provides a data-driven approach to reconstruct the generator of the dynamics from measurements on…
One of the postulates of quantum mechanics is that the Hamiltonian is Hermitian, as this guarantees that the eigenvalues are real. Recently there has been an interest in asking if $H^\dagger = H$ is a necessary condition, and has lead to…
Symmetry plays a central role in the sciences, machine learning, and statistics. While statistical tests for the presence of distributional invariance with respect to groups have a long history, tests for conditional symmetry in the form of…
A symmetry of a state $\vert \psi \rangle$ is a unitary operator of which $\vert \psi \rangle$ is an eigenvector. When $\vert \psi \rangle$ is an unknown state supplied by a black-box oracle, the state's symmetries provide key physical…
We present a quantum algorithm to obtain the response of the atomic nucleus to a small external electromagnetic perturbation. The Hamiltonian of the system is presented by a harmonic oscillator, and the linear combination of unitaries (LCU)…
We have proved new estimates for the coherent control errors of quantum circuits used in quantum computing. These estimates essentially take into account the commutator properties of the Hamiltonians and are based on the formulas of the…
Discovering pragmatic and efficient approaches to construct $\varepsilon$-approximations of quantum operators such as real (imaginary) time-evolution propagators in terms of the basic quantum operations (gates) is challenging. Prior…
We present a quantum probabilistic algorithm which tests with a polynomial computational complexity whether a given composite number is of the Carmichael type. We also suggest a quantum algorithm which could verify a conjecture by…
Quantum correlation includes quantum entanglement and quantum discord. Both entanglement and discord have a common necessary condition--------quantum coherence or quantum superposition. In this paper, we attempt to give an alternative…
Non-Hermitian systems satisfying parity-time (PT) symmetry have aroused considerable interest owing to their exotic features. Anti-PT symmetry is an important counterpart of the PT symmetry, and has been studied in various classical…
Protecting quantum information from the detrimental effects of decoherence and lack of precise quantum control is a central challenge that must be overcome if a large robust quantum computer is to be constructed. The traditional approach to…
Extended quantum mechanics using non-Hermitian, pseudo-Hermitian Hamiltonians is briefly reviewed. Supersymmetric regularizations, solvable simulations and large-N expansion techniques are recollected as suitable means for the study of…
Suppose one has access to oracles generating samples from two unknown probability distributions P and Q on some N-element set. How many samples does one need to test whether the two distributions are close or far from each other in the…
Conformal field theory, describing systems with scaling symmetry, plays a crucial role throughout physics. We describe a quantum algorithm to simulate the dynamics of conformal field theories, including the action of local conformal…
We develop relativistic non-Hermitian quantum theory and its application to neutrino physics in a strong magnetic field. It is well known, that one of the fundamental postulates of quantum theory is the requirement of Hermiticity of…
Analogue Hamiltonian simulation is a promising near-term application of quantum computing and has recently been put on a theoretical footing. In Hamiltonian simulation, a physical Hamiltonian is engineered to have identical physics to…
We discuss three applications of efficient quantum algorithms to determining properties of permutations and group automorphisms. The first uses the Bernstein-Vazirani algorithm to determine an unknown homomorphism from $Z_{p-1}^{m}$ to…
Efficiently characterising quantum systems, verifying operations of quantum devices and validating underpinning physical models, are central challenges for the development of quantum technologies and for our continued understanding of…
Classical algorithms for predicting the equilibrium geometry of strongly correlated molecules require expensive wave function methods that become impractical already for few-atom systems. In this work, we introduce a variational quantum…