Search

When studying the geometry of quantum states, it is acknowledged that mixed states can be distinguished by infinitely many metrics. Unfortunately, this freedom causes metric-dependent interpretations of physically significant geometric quantities such as the complexity and volume of quantum states. In this paper, we present an insightful discussion on the differences between the Bures and the Sjöqvist metrics inside a Bloch sphere. First, we begin with a formal comparative analysis between the two metrics by critically discussing three alternative interpretations for each metric. Second, we explicitly illustrate the distinct behaviors of the geodesic paths on each one of the two metric manifolds. Third, we compare the finite distances between an initial state and the final mixed state when calculated with the two metrics. Interestingly, in analogy with what happens when studying the topological aspects of real Euclidean spaces equipped with distinct metric functions (for instance, the usual Euclidean metric and the taxicab metric), we observe that the relative ranking based on the concept of a finite distance between mixed quantum states is not preserved when comparing distances determined with the Bures and the Sjöqvist metrics. Finally, we conclude with a brief discussion on the consequences of this violation of a metric-based relative ranking on the concept of the complexity and volume of mixed quantum states. [ABSTRACT FROM AUTHOR]

We investigate the use of amplitude amplification on the gate-based model of quantum computing as a means for solving combinatorial optimization problems. This study focuses primarily on quadratic unconstrained binary optimization (QUBO) problems, which are well-suited for qubit superposition states. Specifically, we demonstrate circuit designs which encode QUBOs as 'cost oracle' operations U C , which distribute phases across the basis states proportional to a cost function. We then show that when U C is combined with the standard Grover diffusion operator U s , one can achieve high probabilities of measurement for states corresponding to optimal and near optimal solutions while still only requiring O( π 4 2 N / M ) iterations. In order to achieve these probabilities, a single scalar parameter p s is required, which we show can be found through a variational quantum–classical hybrid approach and can be used for heuristic solutions. [ABSTRACT FROM AUTHOR]

We investigate the irreconcilability issue that arises when translating the search algorithm from the Continuous Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework. For the AQC formulation to evolve along the same path as the CTQW, it requires a constant energy gap in the Hamiltonian throughout the AQC schedule. To resolve the constant gap issue, we modify the CTQW-inspired AQC catalyst Hamiltonian from an XZ operator to a Z oracle operator. Through simulation, we demonstrate that the total running time for the proposed approach for AQC with the modified catalyst Hamiltonian remains optimal as CTQW. Inspired by this solution, we further investigate adaptive scheduling for the catalyst Hamiltonian and its coefficient function in the adiabatic path of Grover-inspired AQC to improve the adiabatic local search. [ABSTRACT FROM AUTHOR]

In this paper, we construct the metric tensor and volume for the manifold of purifications associated with an arbitrary reduced density operator ρ S . We also define a quantum coarse-graining (CG) to study the volume where macrostates are the manifolds of purifications, which we call surfaces of ignorance (SOI), and microstates are the purifications of ρ S . In this context, the volume functions as a multiplicity of the macrostates that quantifies the amount of information missing from ρ S . Using examples where the SOI are generated using representations of S U (2) , S O (3) , and S O (N) , we show two features of the CG: (1) A system beginning in an atypical macrostate of smaller volume evolves to macrostates of greater volume until it reaches the equilibrium macrostate in a process in which the system and environment become strictly more entangled, and (2) the equilibrium macrostate takes up the vast majority of the coarse-grained space especially as the dimension of the total system becomes large. Here, the equilibrium macrostate corresponds to a maximum entanglement between the system and the environment. To demonstrate feature (1) for the examples considered, we show that the volume behaves like the von Neumann entropy in that it is zero for pure states, maximal for maximally mixed states, and is a concave function with respect to the purity of ρ S . These two features are essential to typicality arguments regarding thermalization and Boltzmann's original CG. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Quantum computing has the potential to revolutionize the way hard computational problems are solved in terms of speed and accuracy. Quantum hardware is an active area of research and different hardware platforms are being developed. Quantum algorithms target each hardware implementation and bring advantages to specific applications. The focus of this paper is to compare how well quantum annealing techniques and the QAOA models constrained optimization problems. As a use case, a constrained optimization problem called mission covering optimization is used. Quantum annealing is implemented in adiabatic hardware such as D-Wave, and QAOA is implemented in gate-based hardware such as IBM. This effort provides results in terms of cost, timing, constraints held, and qubits used. [ABSTRACT FROM AUTHOR]

We implement methods from computational homology to obtain a topological signal of singularity formation in a selection of geometries evolved numerically by Ricci flow. Our approach, based on persistent homology, produces precise, quantitative measures describing the behavior of an entire collection of data across a discrete sample of times. We analyze the topological signals of geometric criticality obtained numerically from the application of persistent homology to models manifesting singularities under Ricci flow. The results we obtain for these numerical models suggest that the topological signals distinguish global singularity formation (collapse to a round point) from local singularity formation (neckpinch). Finally, we discuss the interpretation and implication of these results and future applications. [ABSTRACT FROM AUTHOR]

Geometry is often a valuable guide to complex problems in physics. In this paper, we introduce a novel geometric quantity called quantum reactivity (QR) to probe quantum correlations in higher-dimensional quantum systems. Much like quantum discord, QR is not a measure of quantum entanglement but can be useful in quantum information processes where a notion of quantum correlation in higher dimensions is needed. Both quantum discord and QR are extendable to an arbitrarily large number of qubits; however, unlike discord, QR satisfies the invariance under unitary operations. Our approach parallels Schumacher's singlet state triangle inequality, which used an information geometry-based entropic distance. We use a generalization of information distance to area, volume, and higher-dimensional volumes and then use these to define a quantity that we call QR, which is the familiar ratio of surface area to volume. We examine a spectrum of multipartite states (Werner, W, GHZ, randomly generated density matrices, etc.) and demonstrate that QR can provide an ordering of these quantum states as to their degree of quantum correlation. [ABSTRACT FROM AUTHOR]

Geometry is often a valuable guide to complex problems in physics. In this paper, we introduce a novel geometric quantity called quantum reactivity (QR) to probe quantum correlations in higher-dimensional quantum systems. Much like quantum discord, QR is not a measure of quantum entanglement but can be useful in quantum information processes where a notion of quantum correlation in higher dimensions is needed. Both quantum discord and QR are extendable to an arbitrarily large number of qubits; however, unlike discord, QR satisfies the invariance under unitary operations. Our approach parallels Schumacher's singlet state triangle inequality, which used an information geometry-based entropic distance. We use a generalization of information distance to area, volume, and higher-dimensional volumes and then use these to define a quantity that we call QR, which is the familiar ratio of surface area to volume. We examine a spectrum of multipartite states (Werner, W, GHZ, randomly generated density matrices, etc.) and demonstrate that QR can provide an ordering of these quantum states as to their degree of quantum correlation.