benchmarks.wiki

benchmarks.wiki / Public workspace

SciCode / 19.2 / Compute the n-tangle of a n-qubit pure state |ψ⟩ where n is…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

step description prompt

Compute the nn-tangle of a nn-qubit pure state |ψ⟩|\psi\rangle where nn is even. The input is psi, an 2n2^n dimensional array of floats. The output is the nn-tangle of state which is a float.
Plain-text mathematical notation (without MathML)
Compute the n-tangle of a n-qubit pure state |ψ⟩ where n is even. The input is psi, an 2^(n) dimensional array of floats. The output is the n-tangle of state which is a float.
Original LaTeX notation
Compute the $n$-tangle of a $n$-qubit pure state $|\psi\rangle$ where $n$ is even. The input is psi, an $2^n$ dimensional array of floats. The output is the $n$-tangle of state which is a float.

step background

Background For even nn, the nn-tangle of a pure state ψ\psi is given by $$ |\langle\psi|\sigma_y^{\otimes n}|\psi^*\rangle|^2 $$ where σy\sigma_y is the Pauli Y matrix, and $|\psi^*\rangle$ is the complex conjugate of state |ψ⟩|\psi\rangle.
Plain-text mathematical notation (without MathML)
Background
For even n, the n-tangle of a pure state ψ is given by
$$
|\langle\psi|\sigma_y^{\otimes n}|\psi^*\rangle|^2
$$
where σ_(y) is the Pauli Y matrix, and $|\psi^*\rangle$ is the complex conjugate of state |ψ⟩.
Original LaTeX notation
Background
For even $n$, the $n$-tangle of a pure state $\psi$ is given by
$$
|\langle\psi|\sigma_y^{\otimes n}|\psi^*\rangle|^2
$$
where $\sigma_y$ is the Pauli Y matrix, and $|\psi^*\rangle$ is the complex conjugate of state $|\psi\rangle$.

Discussion

Discussion

No discussion posts on this page yet. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.

Source and history

upstream_id / Original problem ID
19.2
task_id
8e41ac28-6922-578f-a3ba-ac705f841f19
task_key
dev--ef21ddbc-f001-52ab-883b-047d71ca2a2b--19~2e2
task_revision_id
5
config / split
/ dev

Official source

initial import