Patent
Quantum processor problem compilation
Alán Aspuru-Guzik,Ryan Babbush,Bryan O'Gorman +2 more
- 25 Jul 2014
14
TL;DR: In this article, the authors propose a method for accepting a specification of the problem that includes a set of terms where each term corresponds to a product of at least three variables and is associated with a non-zero coefficient.
read more
Abstract: Solution of a problem of determining values of a set of N problem variables x i makes use of a quantum processor that has a limited number of hardware elements for representing quantum bits and/or limitations on coupling between quantum bits. A method includes accepting a specification of the problem that includes a specification of a set of terms where each term corresponds to a product of at least three variables and is associated with a non-zero coefficient. A set of ancilla variables, each ancilla variable corresponding to a pair of problem variables, is determined by applying an optimization procedure to the specification of the set of the terms. The accepted problem specification is then transformed according to the determined ancilla variables to form a modified problem specification for use in configuring the quantum processor and solution of problem.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Verified compilation of reversible circuits
Matthew Amy,Martin Roetteler,Krysta M. Svore +2 more
- 03 Mar 2016
TL;DR: In this article, the authors present an example reversible circuit compilers as well as tools and techniques for verifying the correctness of the compilers, which is an important issue in quantum computing.
10
Patent
Triangular dual embedding for quantum annealing
Nan Ding,Hartmut Neven,Alireza Shabani Barzegar,Masoud Mohseni +3 more
- 29 Jun 2017
TL;DR: In this paper, a method for encoding a solution to an optimization task into an energy spectrum of a first Hamiltonian, wherein the first Hamiltonians is represented by a graph comprising nodes and real edges, the graph defining a plurality of loops, was presented.
6
Patent
Method and system for solving the lagrangian dual of a binary polynomially constrained polynomial programming problem using a quantum annealer
Karimi Sahar,Ronagh Pooya +1 more
- 24 Aug 2017
TL;DR: In this paper, the Lagrangian dual of a binary polynomially constrained polynomial programming problem is solved iteratively, until a convergence is detected, iteratively providing a set of Lagrange multipliers.
5
Patent
Methods and systems for setting a system of super conducting qubits having a hamiltonian representative of a polynomial on a bounded integer domain
Sahar Karimi,Pooya Ronagh +1 more
- 30 Nov 2017
TL;DR: In this paper, the authors describe methods, systems, and media for setting a system of superconducting qubits having a Hamiltonian representative of a polynomial on a bounded integer domain via bounded-coefficient encoding.
4
Patent
Efficient topological compilation for metaplectic anyon model
Alexei Bocharov,Wang Zhenghan,Cui Xingshan,Vadym Kliuchnikov +3 more
- 10 May 2018
TL;DR: In this article, a subject unitary operator required for the desired processing can be approximated to any desired precision by a circuit that has to be effectively and efficiently synthesized on a classical computer.
3
References
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
TL;DR: In this article, it was shown that the NP-hard quadratic unconstrained binary optimization (QUBO) problem on a graph G can be solved using an adiabatic quantum computer that implements an Ising spin-1/2 Hamiltonian, by reduction through minor-embedding of G in the quantum hardware graph U.
446
Nonperturbative k -body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
TL;DR: In this paper, an algebraic method has been developed which allows one to engineer several energy levels including the low-energy subspace of interacting spin systems by introducing ancillary qubits, which allows $\mathit{k}$-body interactions to be captured exactly using two-body Hamiltonians.
155
Patent
Systems, devices, and methods for analog processing
Vicky Choi
- 06 Nov 2008
TL;DR: In this paper, a system employs a plurality of physical qubits, each having a respective bias operable to up to six differentiable inputs to solve a Quadratic Unconstrained Binary Optimization problem.
96
Patent
Processing relational database problems using analog processors
William G. Macready,M. Coury,Ivan Sham +2 more
- 31 Oct 2007
TL;DR: In this article, an association graph may be formed based on a query graph and a database graph, providing the results to a query or problem and/or an indication of a level of responsiveness of the results.
61
Patent
Graph embedding techniques
M. Coury,William G. Macready,David Grant +2 more
- 31 Oct 2007
TL;DR: In this article, approaches to embedding source graphs into targets graphs in a computing system are described. But they do not consider the problem of embedding a source graph into a target graph.
60