|
| related topics |
| {entanglement, phys, rev} |
| {qubit, qubits, gate} |
| {states, state, optimal} |
| {measurement, state, measurements} |
| {algorithm, log, probability} |
| {operator, operators, space} |
| {equation, function, exp} |
| {cos, sin, state} |
| {observables, space, algebra} |
| {state, states, entangled} |
| {phase, path, phys} |
|
Measuring polynomial functions of states
Todd A. Brun
abstract: In this paper I show that any $m$th-degree polynomial function of the
elements of the density matrix $\rho$ can be determined by finding the
expectation value of an observable on $m$ copies of $\rho$, without performing
state tomography. Since a circuit exists which can approximate the measurement
of any observable, in principle one can find a circuit which will estimate any
such polynomial function by averaging over many runs. I construct some simple
examples and compare these results to existing procedures.
- oai_identifier:
- oai:arXiv.org:quant-ph/0401067
- categories:
- quant-ph
- comments:
- Minor revisions in response to referee comments
- arxiv_id:
- quant-ph/0401067
- journal_ref:
- Quantum Information and Computation 4, 401 (2004).
- created:
- 2004-01-12
- updated:
- 2004-08-30
Full article ▸
|
|
| related documents |
| 0110032v1 |
| 0205088v1 |
| 0210100v3 |
| 0408022v3 |
| 0507049v2 |
| 9806011v1 |
| 0610258v1 |
| 9911056v1 |
| 0107085v1 |
| 0403160v1 |
| 0701079v1 |
| 0501146v3 |
| 0605213v2 |
| 0701198v1 |
| 0209148v1 |
| 0501093v1 |
| 0307132v1 |
| 0612123v2 |
| 0507194v1 |
| 0612033v1 |
| 0406146v1 |
| 0606242v3 |
| 0105014v2 |
| 0507024v1 |
| 0502144v1 |
|