We present a proof of concept for a spectrally selective thermal mid-IR source based on nanopatterned graphene (NPG) with a typical mobility of CVD-grown graphene (up to 3000
We prove that
- NSF-PAR ID:
- 10411433
- Publisher / Repository:
- Springer Science + Business Media
- Date Published:
- Journal Name:
- Communications in Mathematical Physics
- Volume:
- 401
- Issue:
- 2
- ISSN:
- 0010-3616
- Page Range / eLocation ID:
- p. 1531-1626
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
Abstract $$\hbox {cm}^2\,\hbox {V}^{-1}\,\hbox {s}^{-1}$$ in-plane electric field. The localized surface plasmons (LSPs) on the NPG sheet, partially hybridized with graphene phonons and surface phonons of the neighboring materials, allow for the control and tuning of the thermal emission spectrum in the wavelength regime from$$\lambda =3$$ $$\upmu$$ $$11\times 10^3$$ $$\hbox {m}^2$$ $$T=2000$$ $$V=23$$ $$\upmu$$ $$\upmu$$ $$12^\circ$$ $$80^\circ$$ $$E_F=1.0$$ $$E_F=0.25$$ -
more » « less
Abstract It has been recently established in David and Mayboroda (Approximation of green functions and domains with uniformly rectifiable boundaries of all dimensions.
arXiv:2010.09793 ) that on uniformly rectifiable sets the Green function is almost affine in the weak sense, and moreover, in some scenarios such Green function estimates are equivalent to the uniform rectifiability of a set. The present paper tackles a strong analogue of these results, starting with the “flagship degenerate operators on sets with lower dimensional boundaries. We consider the elliptic operators$$L_{\beta ,\gamma } =- {\text {div}}D^{d+1+\gamma -n} \nabla $$ $$\Omega \subset {\mathbb {R}}^n$$ $$\Gamma $$ $$d < n-1$$ $$D = D_\beta $$ $$D_\beta (X)^{-\beta } = \int _{\Gamma } |X-y|^{-d-\beta } d\sigma (y)$$ $$X \in \Omega $$ $$\beta >0$$ $$\gamma \in (-1,1)$$ G for$$L_{\beta ,\gamma }$$ $$D^{1-\gamma }$$ $$\big | D\nabla \big (\ln \big ( \frac{G}{D^{1-\gamma }} \big )\big )\big |^2$$ $$\Omega $$ -
more » « less
Abstract In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The running time of such a system is defined to be the length of Merlin’s proof plus the running time of Arthur. We provide new Merlin–Arthur proof systems for some key problems in fine-grained complexity. In several cases our proof systems have optimal running time. Our main results include:
Certifying that a list of
n integers has no 3-SUM solution can be done in Merlin–Arthur time$$\tilde{O}(n)$$ $$\tilde{O}(n^{1.5})$$ $$\tilde{O}(n^{1.5})$$ $$\tilde{O}(n^{1.5})$$ Counting the number of
k -cliques with total edge weight equal to zero in ann -node graph can be done in Merlin–Arthur time$${\tilde{O}}(n^{\lceil k/2\rceil })$$ $$k\ge 3$$ k , this bound can be further improved for sparse graphs: for example, counting the number of zero-weight triangles in anm -edge graph can be done in Merlin–Arthur time$${\tilde{O}}(m)$$ k -cliques in unweighted graphs, and had worse running times for smallk .Computing the All-Pairs Shortest Distances matrix for an
n -node graph can be done in Merlin–Arthur time$$\tilde{O}(n^2)$$ $$\Omega (n^2)$$ $$\tilde{O}(n^{2.94})$$ Certifying that an
n -variablek -CNF is unsatisfiable can be done in Merlin–Arthur time$$2^{n/2 - n/O(k)}$$ $$2^{n/2}\cdot \textrm{poly}(n)$$ $$\#$$ k -UNSAT running in$$2^{n/2}/n^{\omega (1)}$$ Certifying a Quantified Boolean Formula is true can be done in Merlin–Arthur time
$$2^{4n/5}\cdot \textrm{poly}(n)$$ $$2^{2n/3}\cdot \textrm{poly}(n)$$ n integers can be done in Merlin–Arthur time$$2^{n/3}\cdot \textrm{poly}(n)$$ $$2^{0.49991n}\cdot \textrm{poly}(n)$$ -
more » « less
Abstract The quantum simulation of quantum chemistry is a promising application of quantum computers. However, for
N molecular orbitals, the$${\mathcal{O}}({N}^{4})$$ $${\mathcal{O}}({N}^{3})$$ $${\mathcal{O}}({N}^{2})$$ $${\mathcal{O}}({N}^{3})$$ $${\mathcal{O}}({N}^{2})$$ $${\mathcal{O}}({N}^{3})$$ -
more » « less
Abstract We continue the program of proving circuit lower bounds via circuit satisfiability algorithms. So far, this program has yielded several concrete results, proving that functions in
$\mathsf {Quasi}\text {-}\mathsf {NP} = \mathsf {NTIME}[n^{(\log n)^{O(1)}}]$ $\mathcal { C}$ $\mathcal { C}$ # SAT algorithms which beat exhaustive search by a minor amount. In this paper, we present a new strong lower bound consequence of having a non-trivial# SAT algorithm for a circuit class${\mathcal C}$ f (x 1,…,x n ) issparse if it outputs 1 onO (1) values of${\sum }_{i} x_{i}$ f , and for all “typical”$\mathcal { C}$ # SAT algorithms for$\mathcal { C}$ $f \circ \mathcal { C}$ stronger than$\mathcal { C}$ # SAT algorithms forn k -size$\mathcal { C}$ n /n k time (for allk ) implyN E X P does not have$(f \circ \mathcal { C})$ # SAT algorithms for$2^{n^{{\varepsilon }}}$ $\mathcal { C}$ $2^{n-n^{{\varepsilon }}}$ ε > 0) implyQ u a s i -N P does not have$(f \circ \mathcal { C})$ Applying
# SAT algorithms from the literature, one immediate corollary of our results is thatQ u a s i -N P does not haveE M A J ∘A C C 0∘T H R circuits of polynomial size, whereE M A J is the “exact majority” function, improving previous lower bounds againstA C C 0[Williams JACM’14] andA C C 0∘T H R [Williams STOC’14], [Murray-Williams STOC’18]. This is the first nontrivial lower bound against such a circuit class.
