12th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2017, Paris, France, June 14-16, 2017

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Theory of Quantum Computation, Communication, and Cryptography

• Publication date

  Unknown publication date

• Fields of study

  Physics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Squashed Entanglement, k-Extendibility, Quantum Markov Chains, and Recovery Maps

  2018cited by this paper
• Proof of the Strong Subadditivity of Quantum-Mechanical Entropy

  2018cited by this paper
• Approximate reversal of quantum Gaussian dynamics

  2017cited by this paper
• Improved reversible and quantum circuits for Karatsuba-based integer multiplication

  2017cited by this paper
• Contextual Fraction as a Measure of Contextuality.

  2017cited by this paper
• Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields

  2016cited by this paper
• Multivariate Trace Inequalities

  2016cited by this paper
• Consequences and applications of the completeness of Hardy's nonlocality

  2016cited by this paper
• Simple, Near-Optimal Quantum Protocols for Die-Rolling

  2016cited by this paper
• Gaussian states minimize the output entropy of one-mode quantum Gaussian channels

  2016cited by this paper
• Energy-Constrained Private and Quantum Capacities of Quantum Channels

  2016cited by this paper
• Gaussian States Minimize the Output Entropy of the One-Mode Quantum Attenuator

  2016cited by this paper
• Monotonicity of $p$-norms of multiple operators via unitary swivels

  2016cited by this paper
• Information-theoretic limitations on approximate quantum cloning and broadcasting

  2016cited by this paper
• One-mode quantum-limited Gaussian channels have Gaussian maximizers

  2016cited by this paper
• Extended Learning Graphs for Triangle Finding

  2016cited by this paper
• Approximate reversibility in the context of entropy gain, information gain, and complete positivity

  2016cited by this paper
• Capacities of Quantum Amplifier Channels

  2016cited by this paper
• Conditional and unconditional Gaussian quantum dynamics

  2016cited by this paper
• From clocks to cloners: Catalytic transformations under covariant operations and recoverability

  2016cited by this paper
• Strengthened monotonicity of relative entropy via pinched Petz recovery map

  2015cited by this paper
• Recoverability in quantum information theory

  2015cited by this paper
• Small Value Parallel Repetition for General Games

  2015cited by this paper
• Rényi generalizations of quantum information measures

  2015cited by this paper
• Work and reversibility in quantum thermodynamics

  2015cited by this paper
• Universal recovery map for approximate Markov chains

  2015cited by this paper
• A Solution of Gaussian Optimizer Conjecture for Quantum Channels

  2015cited by this paper
• Normal form decomposition for Gaussian-to-Gaussian superoperators

  2015cited by this paper
• Quantum Algorithm for Triangle Finding in Sparse Graphs

  2015cited by this paper
• Universal recovery from a decrease of quantum relative entropy

  2015cited by this paper
• Contextuality, Cohomology and Paradox

  2015cited by this paper
• Quantum Fidelity for Arbitrary Gaussian States.

  2015cited by this paper
• Hardy is (almost) everywhere: Nonlocality without inequalities for almost all entangled multipartite states

  2015cited by this paper
• Fundamental limits of repeaterless quantum communications

  2015cited by this paper
• Optimal ancilla-free Clifford+V approximation of z-rotations

  2015cited by this paper
• Swiveled Rényi entropies

  2015cited by this paper
• Optimal measurements for symmetric quantum states with applications to optical communication

  2015cited by this paper
• Rational approximations and quantum algorithms with postselection

  2014cited by this paper
• A search for quantum coin-flipping protocols using optimization techniques

  2014cited by this paper
• A quantum algorithm for computing the unit group of an arbitrary degree number field

  2014cited by this paper
• Renyi generalizations of the conditional quantum mutual information

  2014cited by this paper
• Continuous Variable Quantum Information: Gaussian States and Beyond

  2014cited by this paper
• Quantum cryptography: Public key distribution and coin tossing

  2014cited by this paper
• Rényi squashed entanglement, discord, and relative entropy differences

  2014cited by this paper
• Quantum Conditional Mutual Information, Reconstructed States, and State Redistribution.

  2014cited by this paper
• Ultimate classical communication rates of quantum optical channels

  2014cited by this paper
• Quantum Conditional Mutual Information and Approximate Markov Chains

  2014cited by this paper
• Realistic noise-tolerant randomness amplification using finite number of devices

  2013cited by this paper
• Exponential improvement in precision for simulating sparse Hamiltonians

  2013cited by this paper
• Loss-tolerant quantum cryptography with imperfect sources

  2013cited by this paper
• Conclusive exclusion of quantum states

  2013cited by this paper
• Optimal bounds for semi-honest quantum oblivious transfer

  2013cited by this paper
• Preconditioned quantum linear system algorithm.

  2013cited by this paper
• Strong connections between quantum encodings, non-locality and quantum cryptography

  2013cited by this paper
• Quantum Computation and Quantum Information

  2012cited by this paper
• Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits

  2012cited by this paper
• Constant-optimized quantum circuits for modular multiplication and exponentiation

  2012cited by this paper
• Two-Message Quantum Interactive Proofs and the Quantum Separability Problem

  2012cited by this paper
• Improved quantum query algorithms for triangle finding and associativity testing

  2012cited by this paper
• Information trade-offs for optical quantum communication

  2012cited by this paper
• Efficient Clifford+T approximation of single-qubit operators

  2012cited by this paper
• Operator extension of strong subadditivity of entropy

  2012cited by this paper
• Towards a formulation of quantum theory as a causally neutral theory of Bayesian inference

  2011cited by this paper
• Synthesis and optimization of reversible circuits—a survey

  2011cited by this paper
• The Cohomology of Non-Locality and Contextuality

  2011cited by this paper
• Rank-one quantum games

  2011cited by this paper
• Hedging bets with correlated quantum strategies

  2011cited by this paper
• Fully nonlocal quantum correlations

  2011cited by this paper
• Span programs for functions with constant-sized 1-certificates: extended abstract

  2011cited by this paper
• Optimal Bounds for Quantum Bit Commitment

  2011cited by this paper
• Bell violations through independent bases games

  2011cited by this paper
• The sheaf-theoretic structure of non-locality and contextuality

  2011cited by this paper
• On the reality of the quantum state

  2011cited by this paper
• Unforgeable noise-tolerant quantum tokens

  2011cited by this paper
• Probabilistic and quantum finite automata with postselection

  2011cited by this paper
• Faithful Squashed Entanglement

  2010cited by this paper
• Quantum algorithm for solving linear systems of equations

  2010cited by this paper
• Near-Optimal and Explicit Bell Inequality Violations

  2010cited by this paper
• Towards polynomial lower bounds for dynamic problems

  2010cited by this paper
• Highly entangled states with almost no secrecy.

  2010cited by this paper
• Lower bounds for quantum oblivious transfer

  2010cited by this paper
• Family of loss-tolerant quantum coin-flipping protocols

  2010cited by this paper
• Quantum Strategies and Local Operations

  2010cited by this paper
• Quantum Query Complexity of Minor-Closed Graph Properties

  2010cited by this paper
• Postselection Finite Quantum Automata

  2010cited by this paper
• Subcubic Equivalences between Path, Matrix and Triangle Problems

  2010cited by this paper
• Optimal Quantum Strong Coin Flipping

  2009cited by this paper
• Theoretical framework for quantum networks

  2009cited by this paper
• Two-Message Quantum Interactive Proofs Are in PSPACE

  2009cited by this paper
• Finding, minimizing, and counting weighted subgraphs

  2009cited by this paper
• Computational power of correlations.

  2008cited by this paper
• A matrix convexity approach to some celebrated quantum inequalities

  2008cited by this paper
• Multi-mode bosonic Gaussian channels

  2008cited by this paper
• Distinguishability of Quantum States Under Restricted Families of Measurements with an Application to Quantum Data Hiding

  2008cited by this paper
• Can you beat treewidth?

  2007cited by this paper
• Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem

  2007cited by this paper
• Optimal Quantum Source Coding With Quantum Side Information at the Encoder and Decoder

  2007cited by this paper
• Quantum information with Gaussian states

  2007cited by this paper
• Optical quantum cloning

  2006cited by this paper
• Exact cost of redistributing multipartite quantum states.

  2006cited by this paper

• No citing papers are available for this paper.