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
Systems and methods for finding quantum binary optimization problems
Robert B. Israel,William G. Macready,Zhengbing Bian,Fabián A. Chudak,Mani Ranjbar +4 more
- 27 Mar 2015
TL;DR: In this article, the Ising model penalty function is used to find quantum binary optimization problems and associated gap values employing a variety of techniques, and the penalty gap is defined as the gap separating a set of feasible solutions to the constraint from a set that are infeasible.
22
Patent
Methods and systems for quantum ready computations on the cloud
Majid Dadashikelayeh,Lester Szeto +1 more
- 13 Jun 2016
TL;DR: In this article, the authors present methods, systems, and media for allowing access to quantum computers in a distributed computing environment (e.g., the cloud), such methods and systems may provide optimization and computational services on the cloud.
19
Patent
Methods and systems for quantum ready and quantum enabled computations
Majid Dadashikelayeh,Arman Zaribafiyan +1 more
- 13 Apr 2017
TL;DR: In this article, the authors present methods, systems, and media for allowing access to quantum ready and/or quantum enabled computers in a distributed computing environment (e.g., the cloud).
14
Patent
Methods and systems for quantum computing
Majid Dadashikelayeh,Arman Zaribafiyan,Sahar Karimi,Pooya Ronagh +3 more
- 04 Dec 2017
TL;DR: In this article, the authors present methods, systems, and media for quantum computing, including allowing access to quantum ready and/or quantum enabled computers in a distributed computing environment (e.g., the cloud).
14
Patent
System for reversible circuit compilation with space constraint, method and program
Roetteler Martin,Svore Krysta,Parent Alex +2 more
- 11 Apr 2018
TL;DR: In this paper, the authors proposed a framework for resource efficient compilation of higher-level programs into lower-level reversible circuits, which reduces the memory footprint of a reversible network implemented in a quantum computer and generated from a higher level program.
12
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