I'd guess that the answer is not known above 2 dimensions, but it is very likely that if the answer is known then it is known in dimensions 1, 2, 8 and 24 (1 is trivial), and possibly exactly those dimensions.
The dimensions 1, 2, 3, 8 and 24 are the ones in which we know how to maximize the number of tiles per unit volume (the packing density). The dimensions in which we know how to maximize the number of faces per tile (the kissing number) are 1, 2, 3, 4, 8 and 24. These questions are not the same as minimising the amount of surface, but they are related. The packing density in dimensions 8 and 24 was only proved in 2016 by Maryna Viazovska and a readable article is here. The 8 dimensional packing is called E8 with kissing number 240 and the 24 dimensional packing is called the Leech lattice with kissing number 196,560. I'd love to draw pictures of E8 and the Leech lattice for you, but there are obvious problems.
The point is that E8 and the Leech lattice are surprisingly good packings, so they can sometimes achieve provable bounds for packing problems. Despite the packing problem taking until 2016, the proof is actually reasonably short and simple, at these things go. It's a rare case of a proof just needing a single brilliant idea and then it all just works.
Note that the lattice (called A3) which maximises both the packing density and the kissing number in 3 dimensions is not the one which minimises the area, since it is not the lattice given in RavenclawPrefect's answer, but E8 and the Leech lattice are so good that they have a chance of solving both problems simultaneously.