# Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits

@article{Alam2019AnalysisOQ, title={Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits}, author={Mahabubul Alam and Abdullah Ash- Saki and Swaroop Ghosh}, journal={ArXiv}, year={2019}, volume={abs/1907.09631} }

The quantum approximate optimization algorithm (QAOA) is a promising quantum-classical hybrid technique to solve combinatorial optimization problems in near-term gate-based noisy quantum devices. In QAOA, the objective is a function of the quantum state, which itself is a function of the gate parameters of a multi-level parameterized quantum circuit (PQC). A classical optimizer varies the continuous gate parameters to generate distributions (quantum state) with significant support to the… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-9 OF 9 CITATIONS

## Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets

VIEW 1 EXCERPT

CITES BACKGROUND

## Resiliency Analysis and Improvement of Variational Quantum Factoring in Superconducting Qubit

VIEW 2 EXCERPTS

CITES BACKGROUND

## Accelerating Quantum Approximate Optimization Algorithm using Machine Learning

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 17 REFERENCES

## Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices.

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Quantum Algorithms for Fixed Qubit Architectures

VIEW 1 EXCERPT

## A Quantum Approximate Optimization Algorithm

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## Training A Quantum Optimizer

VIEW 1 EXCERPT