The following pages link to Shengyu Zhang (Q496890):
Displayed 39 items.
- Semiquantum key distribution without invoking the classical party's measurement capability (Q496891) (← links)
- On the power of Ambainis lower bounds (Q557899) (← links)
- The communication complexity of the Hamming distance problem (Q845704) (← links)
- New bounds on classical and quantum one-way communication complexity (Q1029354) (← links)
- Universal and original-preserving quantum copying is impossible (Q1348791) (← links)
- Contextual dependent click bandit algorithm for web recommendation (Q1790952) (← links)
- Multipartite quantum correlation and communication complexities (Q2012182) (← links)
- Quantum game players can have advantage without discord (Q2407098) (← links)
- Quantum strategic game theory (Q2826043) (← links)
- (Q2913796) (← links)
- (Q2913817) (← links)
- New upper and lower bounds for randomized and quantum local search (Q2931424) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- Any AND-OR Formula of Size <i>N</i> Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer (Q3068642) (← links)
- Solving Linear Programming with Constraints Unknown (Q3448779) (← links)
- Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine (Q3452553) (← links)
- A Quantum Protocol for Sampling Correlated Equilibria Unconditionally and without a Mediator (Q3455194) (← links)
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (Q3519535) (← links)
- Tight Bounds for Randomized and Quantum Local Search (Q3575155) (← links)
- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas (Q3578302) (← links)
- Composition Theorems in Communication Complexity (Q3587401) (← links)
- Streaming Algorithms Measured in Terms of the Computed Quantity (Q3608859) (← links)
- On the Tightness of the Buhrman-Cleve-Wigderson Simulation (Q3652231) (← links)
- Linear-Time Algorithm for Quantum 2SAT (Q4568109) (← links)
- Measurement-device-independent semiquantum key distribution (Q4584400) (← links)
- Linear Time Algorithm for Quantum 2SAT (Q4598148) (← links)
- On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems (Q4608570) (← links)
- (Q4633839) (← links)
- Sensitivity Conjecture and Log-rank Conjecture for functions with small alternating numbers (Q5111382) (← links)
- Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States (Q5346440) (← links)
- Efficient quantum protocols for XOR functions (Q5384098) (← links)
- Automata, Languages and Programming (Q5466452) (← links)
- On the complexity of trial and error (Q5495773) (← links)
- Computing and Combinatorics (Q5716962) (← links)
- On The I/O Complexity of Dynamic Distinct Counting (Q5738939) (← links)
- Fourier Sparsity of GF(2) Polynomials (Q5740202) (← links)
- Efficient protocols for generating bipartite classical distributions and quantum states (Q5741817) (← links)
- On the cut dimension of a graph (Q6115369) (← links)
- (Q6147309) (← links)