Related papers: Semiclassical Quantum Computation Solutions to the…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost…
Infinite horizon optimization problems accompany two perplexities. First, the infinite series of utility sequences may diverge. Second, boundary conditions at the infinite terminal time may not be rigorously expressed. In this paper, we…
Quantum networks are considered as a promising future platform for quantum information exchange and quantum applications, which have capabilities far beyond the traditional communication networks. Remote quantum entanglement is an essential…
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum…
Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems such as graph partitioning, community detection, centrality, routing problems, and more. In this paper we explore the use of quantum…
Solving real-world optimization problems with quantum computing requires choosing between a large number of options concerning formulation, encoding, algorithm and hardware. Finding good solution paths is challenging for end users and…
The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum…
Significant advances in the development of computing devices based on quantum effects and the demonstration of their use to solve various problems have rekindled interest in the nature of the "quantum computational advantage." Although…
Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to…
We analyse the use of entangled states to perform quantum computations non locally among distant nodes in a quantum network. The complexity associated with the generation of multiparticle entangled states is quantified in terms of the…
Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we…
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly…
We explore the near-term intersection of quantum computing with the transport sector. To support near-term integration, we introduce a framework for assessing the suitability of transport optimization problems for obtaining potential…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
Near-term quantum computers can hold only a small number of qubits. One way to facilitate large-scale quantum computations is through a distributed network of quantum computers. In this work, we consider the problem of distributing quantum…
The recent development of quantum computing, which uses entanglement, superposition, and other quantum fundamental concepts, can provide substantial processing advantages over traditional computing. These quantum features help solve many…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Combinatorial optimization is considered a promising class of problems in which quantum computers can show significant advantages. However, problems of practical relevance typically have more variables than current or foreseeable quantum…