# Tag Info

6

Quantum computers can run classical computations using exactly the same algorithms, and hence have the same running time in terms of scaling. For example, if you look at shor’s algorithm, a major component of that is modular exponentiation, but nobody ever draws the circuit because they just say “use the classical algorithm”. In terms of absolute running ...

6

Yes, since the trace norm is the sum of the absolute value of the singular values, and the singular values can be found for each of the $a$ blocks independently.

5

There aren't many examples! The main reason for advantages in quantum computers is the ability to constructively combine amplitudes - if you've only got 1 qubit, there aren't any amplitudes to combine! The best use case I can think of is randomness. A quantum computer (implemented with arbitrary error) could theoretically be a near perfect source of entropy,...

5

Your mistake is that you assume that $\rho$ and $\sigma$ are classical-quantum in the same classical basis on $X$. However, there is no need to do so -- all which is necessary is that there exists such a basis, which can however depend on the state. As soon as you choose a different classical basis for the two states, your argument breaks down.

3

Classical computers are inherently deterministic, so they either generate pseudorandom numbers, or use an external physical process with statistically random noise to generate random numbers. Quantum computers are inherently probabilistic, so generating true random numbers is very natural for them. Quantum random number generators are already on the market ...

2

You seem to be mixing two very different concepts here. Quantum cloning is talking about the absolute limits of what is theoretically possible in a perfect world. In this absolute theoretical limit, yes we can derive how well quantum cloning can work, and we also know that classical cloning is nominally perfect. There is then a separate question of how well ...

2

In quantum information theory, the standard way to obtain what it is called reduced density operator from a quantum system composed by several quantum states is to use the so-called partial trace operation. For the case where there are two quantum states, $\rho^{AB}$ can be reduced to $\rho^A$ and $\rho ^B$ in the following way: $\rho^A=tr_B(\rho^{AB})$ \$\...

2

Bra-ket notation is not necessarily tied to "quantum math," it's simply a convenient notation in many circumstances. It may seem intimidating at first, but once you understand the basics (ket = vector, bra = covector) it's straightforward to grasp, as long as you have a solid understanding of Linear Algebra. If you are shaky on Linear Algebra, different ...

2

At least currently, most of the translations being made are in extraordinarily specialized areas - for example, quantum chemistry / computational chemistry. A lot of the math involves mapping domain math to quantum computers - ab initio molecular simulations need to map their traditional annihilation/creation operators to the X, Y, Z gates in quantum ...

1

This question gets right to the heart of what information does a density matrix contain about the state of a qubit. Critically, it is a subjective state of knowledge. So, if I don't know the outcome of the coin flip, my best description of the system is the same in both cases. At the moment that I learn the outcome of the coin flip, I have to update my ...

1

Classical registers are typically used for capturing measurement results, and may also be used for conditionally applying quantum operation. See: https://github.com/Qiskit/openqasm/blob/master/spec/qasm2.rst Given the problem you described, one approach would be to have a classical program that iteratively: 1) defines and executes a quantum circuit on a ...

Only top voted, non community-wiki answers of a minimum length are eligible