Related papers: The duality-character Solution-Information-Carryin…
Quantum computer possesses quantum parallelism and offers great computing power over classical computer \cite{er1,er2}. As is well-know, a moving quantum object passing through a double-slit exhibits particle wave duality. A quantum…
The semiclassical formula for the quantum propagator in the coherent state representation $<\mathbf{z}'' | e^{-i\hat{H}T/\hbar} | \mathbf{z}'>$ is not free from the problem of caustics. These are singular points along the complex classical…
Combining quantum sensing with quantum computing can lead to quantum computational sensors that are able to more efficiently extract task-specific information from physical signals than is possible otherwise. Early examples of quantum…
Dicke states are permutation-invariant superpositions of qubit computational basis states, which play a prominent role in quantum information science. We consider here two higher-dimensional generalizations of these states: $SU(2)$ spin-$s$…
Quantum information scrambling (QIS) describes the rapid spread of initially localized information across an entire quantum many-body system through entanglement generation. Once scrambled, the original local information becomes encoded…
Information exchange between two distant parties, where information is shared without physically transporting it, is a crucial resource in future quantum networks. Doing so with high-dimensional states offers the promise of higher…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. Quantum search algorithm can be described as the rotation of state vectors in…
The quantum partition function at finite temperature requires computing the trace of the imaginary time propagator. For numerical and Monte Carlo calculations, the propagator is usually split into its kinetic and potential parts. A higher…
Reliable preparation of entanglement between distant systems is an outstanding problem in quantum information science and quantum communication. In practice, this has to be accomplished via noisy channels (such as optical fibers) that…
Sequential Quantum State Discrimination (SQSD) can be naturally framed as a sequential decision-making problem: at each time step, an agent must decide whether to perform an additional measurement to gather more information or to conclude…
Quantum search algorithms, such as Grover's algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit…
In this paper, we model and solve a fundamental power system problem, i.e., DC power flow, using a practical quantum computer. The Harrow-Hassidim-Lloyd (HHL) quantum algorithm is used to solve the DC power flow problem. The HHL algorithm…
If the states of spins in solids can be created, manipulated, and measured at the single-quantum level, an entirely new form of information processing, quantum computing, will be possible. We first give an overview of quantum information…
We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal…
Distributed quantum information processing is a promising platform for scaling up quantum information processing, where small- and intermediate-scale quantum devices are connected by a network of quantum channels for communicating quantum…
Quantum state preparation is a fundamental component of quantum algorithms, particularly in quantum machine learning and data processing, where classical data must be encoded efficiently into quantum states. Existing amplitude encoding…
We introduce Superstate Quantum Mechanics (SQM), a theory that considers states in Hilbert space subject to multiple quadratic constraints, with ``energy'' also expressed as a quadratic function of these states. Traditional quantum…
The problem of discriminating between many quantum channels with certainty is analyzed under the assumption of prior knowledge of algebraic relations among possible channels. It is shown, by explicit construction of a novel family of…
In this article, we use the theory of quantum channels and open quantum systems to provide an efficient unitary characterization of a class of stochastic generators known as quantum hidden Markov models (QHMMs). By utilizing the unitary…
As agentic artificial intelligence systems scale across globally distributed and long lived infrastructures, secure and policy compliant communication becomes a fundamental systems challenge. This challenge grows more serious in the quantum…