Quantum Amplitude Amplification (QAA), the generalization of Grover's algorithm, is capable of yielding optimal solutions to combinatorial optimization problems with high probabilities. In this work we extend the conventional 2-dimensional representation of Grover's (orthogonal collective states) to oracles which encode cost functions such as QUBO, and show that linear cost functions are a special case whereby an exact formula exists for determining optimal oracle parameter settings. Using simulations of problem sizes up to 40 qubits we demonstrate QAA's algorithmic performance across all possible solutions, with an emphasis on the closeness in Grover-like performance for solutions near the global optimum. We conclude with experimental demonstrations of generalized QAA on both IBMQ (superconducting) and IonQ (trapped ion) qubits, showing that the observed probabilities of each basis state match our equations as a function of varying the free parameters in the oracle and diffusion operators.
Interactions between many (initially separate) quantum systems raise the question on how to prepare and how to compute the measurable results of their interaction. When one prepares each system individually and let them interact, one has to tensor multiply their density matrices and apply Hamiltonians on the composite system (i.e. the system which includes all the interacting systems) for definite time intervals. Evaluating the final state of one of the systems after multiple consecutive interactions, requires tracing all other systems out of the composite system, which may grow up to immense dimensions. For computation efficiency during the interaction(s) one may consider only the contemporary interacting partial systems, while tracing out the other non interacting systems. In concrete terms, the type of problems to which we direct this formulation is a “target” system interacting succesively with “incident” systems, where the “incident” systems do not mutually interact. For example a two-level atom, interacting succesively with free electrons, or a resonant cavity interacting with radiatively free electrons, or a quantum dot interacting succesively with photons. We refer to a “system” as one of the components before interaction, while each interaction creates a “composite system”. A new interaction of the “composite system” with another “system” creates a “larger composite system”, unless we trace out one of the systems before this interaction. The scope of this work is to show that under proper conditions one may add a system to the composite system just before it interacts, and one may trace out this very system after it finishes to interact. We show in this work a mathematical proof of the above property and give a computational example.
