https://linktr.ee/zkmopro
mopro-linktree
0. Prerequisites
Xcode or Android Studio
Rust and CMake
:::info
Documentation: https://zkmopro.org/docs/prerequisites
:::
Ya-Wen Jeng changed 4 months agoView mode Like Bookmark
Introdoction
UniRep is a private and non-repudiable data system. Users can receive attestations from attesters, and voluntarily prove facts about their data without revealing the data itself.
Using the UniRep protocol, we can establish an anonymous social media platform where user interactions are governed by upvotes and downvotes. This system encourages greater accountability among users when posting and commenting.
Speaker
Vivian
github: https://github.com/vivianjeng
telegram: @vivianjeng
Ya-Wen Jeng changed a year agoView mode Like Bookmark
Comparing proving time (in seconds) in browser: https://mopro-webprover.pages.dev/
and native app
Methodology
TODO:
N=1 or Average of 3 tries?
Browser? Real device?
Full proof vs witness + prove separate?
Which configuration/commit? arkzkey, dylib etc
Build your own application with UniRep is easy. Here are the guides for you to follow:
Getting started with create-unirep-app
Getting started with typescript/javascript
Need idea?
Get some inspiration for what you can you build:What I can build with UniRep?
Applications built by UniRep core contributors
Questions?
Chiali changed 2 years agoView mode Like 1 Bookmark
probability should stay probability $\Rightarrow\mathcal{E}$ is a stochastic map.
Positivity Preservation (PP): $\mathcal{E}(\rho)\geq 0$
Trace Preservation (TP): $\text{tr }\mathcal{E}(\rho)=1$
🧐 These are general restrictions for quantum evolutions?
❌ Difficult in principle: because of entanglement
❌ Difficult in practice: PP is more complicated than complete positivity
Ya-Wen Jeng changed 3 years agoView mode Like Bookmark
Probability outcomes measuring distinguishable states $\leftrightarrow$ Information
Average information gain on state $\rho_A$ for measurement in its eigenbasis
$$S(\rho_A)=-\sum_k\lambda_k\log_2(\lambda_k)$$
Majorization
$$\text{least ordered } (\frac{1}{d},...,\frac{1}{d})\prec (1,0,...0) \text{ most ordered }$$
definition
Ya-Wen Jeng changed 3 years agoView mode Like Bookmark
A glance of both side of the coin at the same time by integrating the coin
(classical: at least two glance of both side)
relies on quantum superposition and entanglement
asks a partial question about a system
Input $x$:
$x\in{0,1}$
Ya-Wen Jeng changed 3 years agoView mode Like Bookmark
Classical
Universality: There exist minimal sets of gates that suffice to implement any classical Boolean circuits. E.g. AND and NOT.
Irreversible computing: The two-bit gates are essentially irresverible and non-invertable: e.g. $a\oplus b$ of XOR gate
loss the information
because two input bits just flow into one output bit
Reversible computing: the number of inputs and outputs are equal
Ya-Wen Jeng changed 3 years agoView mode Like Bookmark
Multi-qubit Deutsch Algorithm
Problem:
For $N=2^n$, we are given an $N$-bit string
input: $x\in{0,1}^N$ such that either:
all $x_i$ have the same value: constant
$N/2$ of the $x_i$ are 0 and $N/2$ of the $x_i$ are 1: balanced
goal: find out whether $x$ is constant or balanced
Ya-Wen Jeng changed 3 years agoView mode Like Bookmark
A quantum computer cannot do
There exists no phisical procedure to copy an arbitrary quantum state.
proof:
Assume that there are two state $|\psi\rangle,|\phi\rangle$, and they can be copied by a unitary $U$
$$|\psi\rangle|s\rangle\xrightarrow[]{U}U|\psi\rangle|s\rangle=|\psi\rangle|\psi\rangle \
|\phi\rangle|s\rangle\xrightarrow[]{U}U|\phi\rangle|s\rangle=|\phi\rangle|\phi\rangle$$
take the inner product
$$(\langle\psi|\langle\psi|)(|\phi\rangle|\phi\rangle)=\langle\psi|\langle s|U^\dagger)(U|\phi\rangle|s\rangle)=\langle\psi|\phi\rangle\langle s|s\rangle=\langle\psi|\phi\rangle\
\therefore \langle\psi|\phi\rangle^2=\langle\psi|\phi\rangle$$
Ya-Wen Jeng changed 3 years agoView mode Like Bookmark
Entanglement
$|00\rangle\xrightarrow[]{C_1NOT_2, H_1} \frac{1}{\sqrt{2}}(|00\rangle+|11\rangle)=|\Phi^+\rangle$
$|01\rangle\xrightarrow[]{C_1NOT_2, H_1} \frac{1}{\sqrt{2}}(|01\rangle+|10\rangle)=|\Psi^+\rangle$
$|10\rangle\xrightarrow[]{C_1NOT_2, H_1} \frac{1}{\sqrt{2}}(|00\rangle-|11\rangle)=|\Phi^-\rangle$
$|11\rangle\xrightarrow[]{C_1NOT_2, H_1} \frac{1}{\sqrt{2}}(|01\rangle-|10\rangle)=|\Psi^-\rangle$
Bell state are equivalent up to local unitary operations
$|\Psi^+\rangle=X_1|\Phi^+\rangle=X_2|\Phi^+\rangle$
Ya-Wen Jeng changed 3 years agoView mode Like Bookmark
Protocol
The Bell state shared by $A$ and $B$ is available
$A:1/\sqrt{2}(|0_A0_B\rangle+|1_A1_B\rangle)$
$B:1/\sqrt{2}(|0_A0_B\rangle+|1_A1_B\rangle)$
$A$ interacts her qubit with the (unknown) state $|\psi\rangle$
assume that $|\psi\rangle = \alpha|0\rangle+\beta|1\rangle$
Ya-Wen Jeng changed 3 years agoView mode Like Bookmark
Linear map
Hermicity-preserving map (HP)
Completely-positive maps (CP)
Trace non-increasing (TNI) maps
$$\text{tr}A\mathcal{M}{Ab}(\rho_A)\leq\text{tr}_A \rho_A$$
$\mathcal{E}A$$=\sum_b$$\mathcal{M}{Ab}$ is a quantum channel with trace-preserving (TP) instead of trace non-increasing (TNI).
🧐 Do measurement superoperators ${\mathcal{M}_b}$ describe any measurement?
Ya-Wen Jeng changed 3 years agoView mode Like Bookmark