Recent content by siddjain

This question is in regards to Dwave's quantum computer which is tailored to solve QUBO problems (minimize $x^T Q x$ where $Q$ is a symmetric matrix and $x$ is $n$ length vector of $0$s and $1$s) using quantum annealing. I would like to understand how it works. The claim is that it does so by...

Prove that $$(|z_1 + z_2| + |z_1 - z_2|)(|z_1| + |z_2|) >= \sqrt{2}$$