A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to the underlying structure of abstract search spaces, and is analytically simpler than previous structured search methods. The algorithm is evaluated empirically with a variety of search problems, and shown to be particularly effective for searches with many constraints. Furthermore, the algorithm provides a simple framework for utilizing search heuristics. It also exhibits the same phase transition in search difficulty as found for sophisticated classical search methods, indicating it is effectively using the problem structure.
An algorithm for structured database searching is presented and used to solve the set partition problem. O(n) oracle calls are required in order to obtain a solution, but the probability that this solution is optimal decreases exponentially with problem size. Each oracle call is followed by a measurement, implying that it is necessary to maintain quantum coherence for only one oracle call at a time.
The highly structured search algorithm proposed by Hogg[Phys.Rev.Lett. 80,2473(1998)] is implemented experimentally for the 1-SAT problem in a single search step by using nuclear magnetic resonance technique with two-qubit sample. It is the first demonstration of the Hogg's algorithm, and can be readily extended to solving 1-SAT problem for more qubits in one step if the appropriate samples possessing more qubits are experimentally feasible.
This paper shows how a basic property of unitary transformations can be used for meaningful computations. This approach immediately leads to search-type applications, where it improves the number of steps by a square-root - a simple minded search that takes N steps, can be improved to O(sqrt(N)) steps. The quantum search algorithm is one of several immediate consequences of this framework. Several novel search-related applications are presented.
An unstructured search for one item out of N can be performed quantum mechanically in time of order square root of N whereas classically this requires of order N steps. This raises the question of whether square root speedup persists in problems with more structure. In this note we focus on one example of a structured problem and find a quantum algorithm which takes time of order the square root of the classical time.
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speed-up over a classical search, just as Grover's algorithm. In this paper, we study how the structure of the search problem may be exploited to further improve the efficiency of these quantum adiabatic algorithms. We show that by nesting a partial search over a reduced set of variables into a global search, it is po…
Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state space of a graph. The algorithm is based on a local diabatic evolution of the Hamiltonian associated with the graph. The main new idea is to apply some techniques such as Krylov bspace projection methods, Lanczos algorithm and spectral distribution methods. Indeed, using these techniques together with the second-order perturbation theory, we give a systematic …
We examine the use of adiabatic quantum algorithms to solve structured, or nested, search problems. We construct suitable time dependent Hamiltonians and derive the computation times for a general class of nested searches involving n qubits. As expected, we find that as additional structure is included, the Hamiltonians become more local and the computation times decrease.
In the multitarget Grover algorithm, we are given an unstructured N-element list of objects S_i containing a T-element subset tau and function f, called an oracle, such that f(S_i)=1 if S_i is in tau, otherwise f(S_i) = 0. By using quantum parallelism, an element of tau can be retrieved in O(sqrt(N/T)) steps, compared to O(N/T) for any classical algorithm. It is shown here that in combinatorial optimization problems with N=4^M, the density of states can be used in conjunction with the multitarget Grover algorithm to construct a sequence of oracles that structure the search so that the optimum …
We present quantum algorithms to search for marked vertices in structured databases with low connectivity. Adopting a multi-stage search process, we achieve a success probability close to $100\%$ on Cayley trees with large branching factors. We find that the number of stages required is given by the height of the Cayley tree. At each stage, the jumping rate should be chosen as different values. The dominant term of the runtime in the search process is proportional to $N^{(2r-1)/2r}$ for the Cayley tree of height $r$ with $N$ vertices. We further find that one can control the number of stages b…
We present a new adiabatic quantum algorithm for searching over structured databases. The new algorithm is optimized using a simplified complexity analysis.
We demonstrate a quantum interference experiment between two photons coming from non-degenerate pairs created by four-wave mixing in two separated micro-structured fibres. When the two heralded photons are made indistinguishable a 95% visibility is demonstrated.
Towards reconstructing quantum structured light on a quantum computer
School of Physics, University of the Witwatersrand（威特沃特斯兰德大学物理学院）；School of Computer Science and Applied Mathematics, University of the Witwatersrand（威特沃特斯兰德大学计算机科学与应用数学学院）
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data in the form of pairs of input and output quantum states associated with the vertices of a graph, together with edges encoding correlations between the vertices. We explain how to systematically exploit this additional graph structure to improve quantum learning algorithms. These algorithms are numerically simulated and exhibit excellent learning behavior. S…
In recent years, new neural network architectures designed to operate on graph-structured data have pushed the state-of-the-art in the field. A large set of these architectures utilize a form of classical random walks to diffuse information. We propose quantum walk neural networks (QWNN), a novel graph neural network architecture based on quantum random walks, the quantum parallel to classical random walks. A QWNN learns a quantum walk on a graph to construct a diffusion operator which can then be applied to graph-structured data. We demonstrate the use of QWNNs on a variety of prediction task…
Understanding dynamics of localized quantum systems embedded in engineered bosonic environments is a central problem in quantum optics and open quantum system theory. We present a formalism for studying few-particle scattering from a localized quantum system interacting with an bosonic bath described by an inhomogeneous wave-equation. In particular, we provide exact relationships between the quantum scattering matrix of this interacting system and frequency domain solutions of the inhomogeneous wave-equation thus providing access to the spatial distribution of the scattered few-particle wave-p…
Solving optimisation problems is a promising near-term application of quantum computers. Quantum variational algorithms leverage quantum superposition and entanglement to optimise over exponentially large solution spaces using an alternating sequence of classically tunable unitaries. However, prior work has primarily addressed discrete optimisation problems. In addition, these algorithms have been designed generally under the assumption of an unstructured solution space, which constrains their speedup to the theoretical limits for the unstructured Grover's quantum search algorithm. In this pap…
The interaction of quantum emitters with structured baths modifies both their individual and collective dynamics. In González-Tudela \emph{et al} we show how exotic quantum dynamics emerge when QEs are spectrally tuned around the middle of the band of a two-dimensional structured reservoir, where we predict the failure of perturbative treatments, anisotropic interactions and novel super and subradiant behaviour. In this work, we provide further analysis of that situation, together with a complete analysis for the quantum emitter dynamics in spectral regions different from the center of the ban…
A hierarchical, reversible mapping between levels of tree structured computation, applicable for structuring the Quantum Computation algorithm for NP-complete problem is presented. It is proven that confining the state of a quantum computer to a subspace of the available Hilbert space, where states are consistent with the problem constraints, can be done in polynomial time. The proposed mapping, together with the method of state reduction can be potentially used for solving NP-complete problems in polynomial time.
We develop a theoretical framework for the analysis of the quantum coherence of light emitted by two independent single-photon sources in an arbitrary environment. The theory provides design rules for the control of the degree of quantum coherence, in terms of classical quantities widely used in nanophotonics. As an important example, we derive generalized conditions to generate superradiant and subradiant states of the emitters, and demonstrate the ability of a structured environment to induce long-range quantum coherence. These results should have broad applications in quantum nanophotonics,…
We present a method for dealing with quantum systems coupled to a structured reservoir with any density of modes and with more than one excitation. We apply the method to a two-level atom coupled to the edge of a photonic band gap and a defect mode. Results pertaining to this system, provide the solution to the problem of two photons in the reservoir and possible generalization is discussed.
In classical computation, a problem can be solved in multiple steps where calculated results of each step can be copied and used repeatedly. While in quantum computation, it is difficult to realize a similar multi-step computation process because the no-cloning theorem forbids making copies of an unknown quantum state perfectly. We find a method based on quantum resonant transition to protect and reuse an unknown quantum state that encodes calculated results of an intermediate step without making copies of the state, and present a quantum algorithm that solves a problem via a multi-step quantu…
We present a non-Markovian quantum trajectory method for treating atoms radiating into a reservoir with a non-flat density of states. The results of an example numerical simulation of the case where the free space modes of the reservoir are altered by the presence of a cavity are presented and compared with those of an extended system approach.
We show enough evidence that a structured version of Adiabatic Quantum Computation (AQC) is efficient for most satisfiability problems. More precisely, when the success probability is fixed beforehand, the computational resources grow subexponentially in the number of qubits. Our study focuses on random satisfiability and exact cover problems, developing a multi-step algorithm that solves clauses one by one. Relating the computational cost to classical properties of the problem, we collect significant statistics with up to N=140 qubits, around the phase transitions, which is where the hardest …
We investigate the long-lived quantum coherence of two-level spontaneous emission models within structured environments. The population of the system under the asymptotic non-Markovian dynamics is linked to the spectral density of the reservoir through a general functional relation between them. We figure out explicitly the preservation of quantum coherence, via notions of entanglement and quantum discord, in connection with the spectral parameters of Ohmic class reservoirs and then show how to achieve them optimally. We expect these results to contribute towards reservoir engineering with the…
We consider structured environments modeled by bosonic quantum networks and investigate the probing of their spectral density, structure, and topology. We demonstrate how to engineer a desired spectral density by changing the network structure. Our results show that the spectral density can be very accurately detected via a locally immersed quantum probe for virtually any network configuration. Moreover, we show how the entire network structure can be reconstructed by using a single quantum probe. We illustrate our findings presenting examples of spectral densities and topology probing for net…
The concept of quantum coherence and its possible use as a resource are currently the subject of active researches. Uncertainty and complementarity relations for quantum coherence allow one to study its changes with respect to other characteristics of the process of interest. Protocols of quantum information processing often use measurements that have a special inner structure. Quantum designs are considered as tools with a perspective of fruitful applications in quantum information processing. We obtain uncertainty and certainty relations for coherence averaged with respect to a set of design…
We study the role of driving in an initial maximally entangled state evolving under the presence of a structured environment in a weak and strong regime. We focus on the enhancement and degradation of maximal Concurrence when the system is driven on and out of resonance for a general evolution, as well as the effect of adding a transverse coupling among the particles of the model. We further investigate the role of driving in the acquisition of a geometric phase for the maximally entangled state. As the model studied herein can be used to model experimental situations such as hybrid quantum cl…
Structured photons are nowadays an interesting resource in classical and quantum optics due to the richness of properties they show under propagation, focusing and in their interaction with matter. Vectorial modes of light in particular, a class of modes where the polarization varies across the beam profile, have already been used in several areas ranging from microscopy to quantum information. One of the key ingredients needed to exploit the full potential of complex light in quantum domain is the control of quantum interference, a crucial resource in fields like quantum communication, sensin…
The non-Markovian master equations are derived to study quantum discord dynamics of two qubits coupled to a common reservoir and two independent reservoirs, respectively. We compare the dynamics under different parameters, such as reservoir spectra and resonant parameters, at high temperature and at zero temperature. The results indicate that the dynamics at these two extreme temperatures share similar characters, as well as differences.
We study the problem of robust performance of quantum systems under structured uncertainties. A specific feature of closed (Hamiltonian) quantum systems is that their poles lie on the imaginary axis and that neither a coherent controller nor physically relevant structured uncertainties can alter this situation. This changes for open systems where decoherence ensures asymptotic stability and creates a unique landscape of pure performance robustness, with the distinctive feature that closed-loop stability is secured by the underlying physics and needs not be enforced. This stability, however, is…
We relate the principle of quantum-memory-assisted entropic uncertainty to quantum teleportation and show geometrically that any two-qubit state which lowers the upper bound of this uncertainty relation is useful for teleportation. We also explore the efficiency of this entropic uncertainty principle on witnessing entanglement in a general class of bosonic structured reservoirs. The entanglement regions witnessed by different estimates are determined, which may have no relation with the explicit form of the spectral density of the reservoir for certain special chosen sets of the initial states…
We present a class of numerical algorithms which adapt a quantum error correction scheme to a channel model. Given an encoding and a channel model, it was previously shown that the quantum operation that maximizes the average entanglement fidelity may be calculated by a semidefinite program (SDP), which is a convex optimization. While optimal, this recovery operation is computationally difficult for long codes. Furthermore, the optimal recovery operation has no structure beyond the completely positive trace preserving (CPTP) constraint. We derive methods to generate structured channel-adapted …
We study the role of driving in a two-level system evolving under the presence of a structured environment. We find that adding a periodical modulation to the two-level system can greatly enhance the survival of the geometric phase for many time periods. We show that this effect is mainly important for a markovian regimen but can still be found when the environment exhibits non-markovian behavior as time revivals. This knowledge can aid the search for physical set-ups that best retain quantum properties under dissipative dynamics.
The reservoir memory effects can lead to information backflow and recurrence of the previously lost quantum correlations. We establish connections between the direction of information flow and variation of the geometric quantum discords (GQDs) measured respectively by the trace distance, the Hellinger distance, and the Bures distance for two qubits subjecting to the bosonic structured reservoirs, and unveil their dependence on a factor whose derivative signifies the (non-)Markovianity of the dynamics. By considering the reservoirs with Lorentzian and Ohmic-like spectra, we further demonstrated…
We explore the set of unitary matrices characterized by a given structure in the context of their applications in the field of Quantum Information. In the first part of the Thesis we focus on classification of special classes of unitary matrices and possibility of introducing certain internal parameterizations. Several new results and conjectures are discussed. Second part of the Thesis is devoted to the concept of multipartite quantum entanglement. We present a solution to the problem of absolutely maximally entangled states of four subsystems with six levels each. Finally, we analyze the exc…
The spontaneous emission rate of a quantum dot coupled to a structured photonic reservoir is determined by the frequency dependence of its local density of photon states. Through phonon-dressing, a breakdown of Fermi's golden rule can occur for certain photonic structures whose photon decay time become comparable to the longitudinal acoustic phonon decay times. We present a polaron master equation model to calculate the photoluminescence intensity from a coherently excited quantum dot coupled to a structured photonic reservoir. We consider examples of a semiconductor microcavity and a coupled …
Matter wave interferometry is becoming an increasingly important technique in quantum metrology. However, unlike its photonic counterpart, this technique relies on the interference of particles possessing a non-zero rest mass and an electric charge. Matter waves, thus, can experience alterations in their wave-like features while propagating through uniform fields to which a linear potential can be attributed. Here, we derive analytical expressions for structured matter waves subjected to linear potentials. We show that the center of mass of corresponding to these wavefunctions follows the clas…
Quantum processing units (QPUs) executing annealing algorithms have shown promise in optimization and simulation applications. Hybrid algorithms are a natural bridge to additional applications of larger scale. We present a straightforward and effective method for solving larger-than-QPU lattice-structured Ising optimization problems. Performance is compared against simulated annealing with promising results, and improvement is shown as a function of the generation of D-Wave QPU used.
Entanglement in high-dimensional quantum systems, where one or more degrees of freedom of light are involved, offers increased information capacities and enables new quantum protocols. Here, we demonstrate a functional source of high-dimensional, noise-resilient hyperentangled states encoded in time-frequency and vector-vortex structured modes, which in turn carry single-particle entanglement between polarisation and orbital angular momentum. Pairing nonlinearity-engineered parametric downconversion in an interferometric scheme with spin-to-orbital-angular-momentum conversion, we generate high…
Entanglement is a holistic property of multipartite quantum systems, which is accompanied by the establishment of nonclassical correlations between subsystems. Most entanglement mechanisms can be described by a coherent interaction Hamiltonian, and entanglement develops over time. In other words, the generation of entanglement has a time arrow. Dissipative structure theory directs the evolving time arrow of a non-equilibrium system. By dissipating energy to the environment, the system establishes order out of randomness. This is also referred to as self-organization. Here, we explore a new mec…
Tomography of Quantum States from Structured Measurements via quantum-aware transformer
University of New South Wales（新南威尔士大学）；The Australian National University（澳大利亚国立大学）；University of Technology Sydney（悉尼科技大学）；Nanjing University（南京大学）；Princeton University（普林斯顿大学）
Quantum trapping potentials for ultracold gases change the landscape of classical properties of scattered light and matter. The atoms in a quantum many-body correlated phase of matter change the properties of light and vice versa. The properties of both light and matter can be tuned by design and depend on the interplay between long-range (nonlocal) interactions mediated by an optical cavity and short-range processes of the atoms. Moreover, the quantum properties of light get significantly altered by this interplay, leading the light to have nonclassical features. Further, these nonclassical f…
QB Information Technologies (1QBit)（1QB信息技术公司（1QBit））；University of British Columbia（不列颠哥伦比亚大学）；Institute for Quantum Computing（量子计算研究所）；University of Waterloo（滑铁卢大学）
We introduce two quantum algorithms for solving structured prediction problems. We first show that a stochastic gradient descent that uses the quantum minimum finding algorithm and takes its probabilistic failure into account solves the structured prediction problem with a runtime that scales with the square root of the size of the label space, and in $\widetilde O\left(1/ε\right)$ with respect to the precision, $ε$, of the solution. Motivated by robust inference techniques in machine learning, we then introduce another quantum algorithm that solves a smooth approximation of the structured pre…
