Quantum Mechanical Hilbert Transformation for Normally Ordering Coulomb Potential-Type Operators

We show that the technique of integration within an ordered product of operators can be extended to Hilbert transform. In so doing we derive normally ordered expansion of Coulomb potential-type operators directly by using the mathematical Hilbert transform formula.     

Quantum Mechanical Hilbert Transformation for Normally Ordering Coulomb Potential-Type Operators

We show that the technique of integration within an ordered product of operators can be extended to Hilbert transform. In so doing we derive normally ordered expansion of Coulomb potential-type operators directly by using the mathematical Hilbert transform formula.     

Quantum Algorithms for Some Well—Known NP Problems

It is known that quantum computer is more powerful than classical computer.In this paper we present quantum algorithms for some famous NP problems in graph theory and combination theory,these quantum algorithms are at least quadratically faster than the classical ones.     

The Projective Hilbert Space as a Classical Phase Space for Nonrelativistic Quantum Dynamics

The projective Hilbert space carries a natural symplectic structure which enables one to reformulate quantum dynamics as a classical Hamiltonian one. PACS: 03.65.Ta, 02.40.Yy, 45.20.Jj.     

Equations Holding in Hilbert Lattices

We produce and study several sequences of equations, in the language of orthomodular lattices, which hold in the ortholattice of closed subspaces of any classical Hilbert space, but not in all orthomodular lattices. Most of these equations hold in any orthomodular lattice admitting a strong set of states whose values are in a real Hilbert space. For some of these equations, we give conditions under which they hold in the ortholattice of closed subspaces of a generalised Hilbert space. These conditions are relative to the dimension of the Hilbert space and to the characteristic of its division ring of scalars. In some cases, we show that these equations cannot be deduced from the already known equations, and we study their mutual independence. To conclude, we suggest a new method for obtaining such equations, using the tensorial product. PACS numbers: 02.10, 03.65, 03.67     

Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database

An important and usual sort of search problems is to find all marked states from an unsorted database with a large number of states. Grover's original quantum search algorithm is for finding single marked state with uncertainty, and it has been generalized to the case of multiple marked states, as well as been modified to find single marked state with certainty. However, the query complexity for finding all multiple marked states has not been addressed. We use a generalized Long's algorithm with high precision to solve such a problem. We calculate the approximate query complexity, which increases with the number of marked states and with the precision that we demand. In the end we introduce an algorithm for the problem on a "duality computer" and show its advantage over other algorithms.     

Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database

An important and usual sort of search problems is to find all marked states from an unsorted database with a large number of states. Grover＇s original quantum search algorithm is for finding single marked state with uncertainty, and it has been generalized to the case of multiple marked states, as well as been modified to find single marked state with certainty. However, the query complexity for finding all multiple marked states has not been addressed. We use a generalized Long＇s algorithm with high precision to solve such a problem. We calculate the approximate query complexity, which increases with the number of marked states and with the precision that we demand. In the end we introduce an algorithm for the problem on a ＂duality computer＂ and show its advantage over other algorithms.     

高维辅助的普适量子线路优化

受到Lanyon等(Lanyon B P et al 2008 Nature Physics. 5 134)利用高维Hilbert空间成功简化Toffoli门的启发, 本文将辅助维度应用到普适量子线路中, 结合Cosine-Sine Decomposition(CSD), Quantum Shannon Decomposition(QSD)等矩阵分解方法, 优化了两比特和三比特普适幺正量子线路, 给出了计算n比特普适量子线路复杂度的公式, 并利用线性光学和腔QED系统设计了实验方案. 结果表明, 两比特和三比特量子线路的复杂度已分别接近和优于目前最优结果, 且随着比特数的增加, 本方案的优势愈加明显.     

量子力学基态能量计算的改进蚁群优化算法

为进一步减少迭代次数和改善解的质量,对蚁群优化方法进行改进.在求解体系基态能上与传统的变分法相比有很大的优势.求解了氦原子基态能量,并应用于不同半径量子点中砷化镓类氢施主基态能量的计算.通过与变分法和遗传算法的比较,展示了算法的性能.     

Quantum Pushdown Automata

Quantum automata are mathematical models for quantum computing. We analyze the existing quantum pushdown automata, propose a q quantum pushdown automata (qQPDA), and partially clarify their connections. We emphasize some advantages of our qQPDA over others. We demonstrate the equivalence between qQPDA and another QPDA. We indicate that qQPDA are at least as powerful as the QPDA of Moore and Crutchfield with accepting words by empty stack. We introduce the quantum languages accepted by qQPDA and prove that every -q quantum context-free language is also an -q quantum context-free language for any (0, 1) and (0, 1).     

Supersymmetric Positivity and Supersymmetric Hilbert Space

We introduce simple notions of positivity and Hilbert spaces of supersym metric functions naturally suggested by the superspace formulation of supersymmetric quantum field theory. Several applications are indicated.     

The Quantum Phase Problem: Steps Toward a Resolution

Defining the observable canonically conjugate to the number observable N has long been an open problem in quantum theory. The problem stems from the fact that N is bounded from below. In a previous work we have shown how to define the absolute phase observable || by suitably restricting the Hilbert space of x and p like variables. Here we show that also from the classical point of view, there is no rigorous definition for the phase even though it's absolute value is well defined.     

Gaussian Amplitude Amplification for Quantum Pathfinding

We study an oracle operation, along with its circuit design, which combined with the Grover diffusion operator boosts the probability of finding the minimum or maximum solutions on a weighted directed graph. We focus on the geometry of sequentially connected bipartite graphs, which naturally gives rise to solution spaces describable by Gaussian distributions. We then demonstrate how an oracle that encodes these distributions can be used to solve for the optimal path via amplitude amplification. And finally, we explore the degree to which this algorithm is capable of solving cases that are generated using randomized weights, as well as a theoretical application for solving the Traveling Salesman problem.     

Fermion Representation of Quantum Toroidal Algebra

We construct a fermion analogue of the Fock representation of quantum toroidal algebra and construct the fermion representation of quantum toroidal algebra on the K-theory of Hilbert scheme.     

Dynamical Localization Simulated on Actual Quantum Hardware

Quantum computers are invaluable tools to explore the properties of complex quantum systems. We show that dynamical localization of the quantum sawtooth map, a highly sensitive quantum coherent phenomenon, can be simulated on actual, small-scale quantum processors. Our results demonstrate that quantum computing of dynamical localization may become a convenient tool for evaluating advances in quantum hardware performances.     

Variational Quantum Chemistry Programs in JaqalPaq

We present example quantum chemistry programs written with JaqalPaq, a python meta-programming language used to code in Jaqal (Just Another Quantum Assembly Language). These JaqalPaq algorithms are intended to be run on the Quantum Scientific Computing Open User Testbed (QSCOUT) platform at Sandia National Laboratories. Our exemplars use the variational quantum eigensolver (VQE) quantum algorithm to compute the ground state energies of the H2, HeH+, and LiH molecules. Since the exemplars focus on how to program in JaqalPaq, the calculations of the second-quantized Hamiltonians are performed with the PySCF python package, and the mappings of the fermions to qubits are obtained from the OpenFermion python package. Using the emulator functionality of JaqalPaq, we emulate how these exemplars would be executed on an error-free QSCOUT platform and compare the emulated computation of the bond-dissociation curves for these molecules with their exact forms within the relevant basis.     

Quantum Bitcoin Mining

This paper studies the effect of quantum computers on Bitcoin mining. The shift in computational paradigm towards quantum computation allows the entire search space of the golden nonce to be queried at once by exploiting quantum superpositions and entanglement. Using Grover’s algorithm, a solution can be extracted in time O(2256/t), where t is the target value for the nonce. This is better using a square root over the classical search algorithm that requires O(2256/t) tries. If sufficiently large quantum computers are available for the public, mining activity in the classical sense becomes obsolete, as quantum computers always win. Without considering quantum noise, the size of the quantum computer needs to be ≈104 qubits.     

Tensor Products of Quantum Structures and Their Applications in Quantum Measurements

Tensor products of quantum logics and effect algebras with some known problems are reviewed. It is noticed that although tensor products of effect algebras having at least one state exist, in the category of complex Hilbert space effect algebras similar problems as with tensor products of projection lattices occur. Nevertheless, if one of the two coupled physical systems is classical, tensor product exists and can be considered as a Boolean power. Some applications of tensor products (in the form of Boolean powers) to quantum measurements are reviewed.     

Initializing the Amplitude Distribution of a Quantum State

To date, quantum computational algorithms have operated on a superposition of all basis states of a quantum system. Typically, this is because it is assumed that some function f is known and implementable as a unitary evolution. However, what if only some points of the function f are known? It then becomes important to be able to encode only the knowledge that we have about f. This paper presents an algorithm that requires a polynomial number of elementary operations for initializing a quantum system to represent only the m known points of a function f.