Все публикации

1:09:41

Fault-tolerant Simulation of Lattice Gauge Theories with Gauge Covariant Codes

1:08:00

Multivariate Fidelities

1:01:28

Triply efficient shadow tomography

1:09:39

Realization of an Andreev Spin qubit

1:05:12

Certifying almost all quantum states with few single qubit measurements

1:07:44

Verification of Recursively Defined Quantum Circuits

0:45:16

A fixed point algorithm for matrix projections with applications in quantum information

0:55:45

Two prover perfect zero knowledge for MIP*

0:50:27

Useful entanglement can be extracted from noisy graph states

0:55:05

Unconditional quantum MAGIC advantage in shallow circuit computation

0:56:46

Polynomial Time Classical Simulation of Noisy IQP Circuits with Constant Depth

1:10:04

Extending the Known Region of Nonlocal Boxes that Collapse Communication Complexity

0:59:49

Graph theoretical optimization of fusion based graph state generation

1:07:38

Quantum complexity of testing signed graph clusterability

1:05:05

Doubling the order of approximation via the randomized product formula

1:12:53

Monogamy of highly symmetric states

1:05:56

Unbounded Quantum Advantage in One-Way SC Complexity of a Distributed Clique Labelling Relation

0:55:17

Incorporating Zero Probability Constraints to Device Independent Randomness Expansion

0:57:58

Characterizing First Arrival Position Channels: Noise Distribution and Capacity Analysis

1:05:18

Filtering crosstalk from bath non-Markovianity via spacetime classical shadows

0:49:45

A super-polynomial quantum advantage for combinatorial optimization problems

1:12:18

Non-uniformity and Quantum Advice in the Quantum Random Oracle Model

1:09:43

Reduce&chop: Shallow circuits for deeper problems

1:03:32

Optimizing classical shadows with insights from quantum dynamics